July 2011 High-order schemes for high-frequency Helmholtz equation 1 Parallel solution of high-frequency Helmholtz equation using high- order finite difference.

Slides:



Advertisements
Similar presentations
4 th order Embedded Boundary FDTD algorithm for Maxwell Equations Lingling Wu, Stony Brook University Roman Samulyak, BNL Tianshi Lu, BNL Application collaborators:
Advertisements

Chapter 6: Roots: Open Methods
Part 2 Chapter 6 Roots: Open Methods
Parallel Jacobi Algorithm Steven Dong Applied Mathematics.
Chapter 2 Solutions of Systems of Linear Equations / Matrix Inversion
1 Numerical Simulation for Flow in 3D Highly Heterogeneous Fractured Media H. Mustapha J. Erhel J.R. De Dreuzy H. Mustapha INRIA, SIAM Juin 2005.
Chapter 8 Elliptic Equation.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.
Use of Kalman filters in time and frequency analysis John Davis 1st May 2011.
03/29/2006, City Univ1 Iterative Methods with Inexact Preconditioners and Applications to Saddle-point Systems & Electromagnetic Maxwell Systems Jun Zou.
Improvement of a multigrid solver for 3D EM diffusion Research proposal final thesis Applied Mathematics, specialism CSE (Computational Science and Engineering)
Fatih Ecevit Max Planck Institute for Mathematics in the Sciences V í ctor Dom í nguez Ivan Graham New Galerkin Methods for High-frequency Scattering Simulations.
FastPlace: Efficient Analytical Placement using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model FastPlace: Efficient Analytical Placement.
Numerical Algorithms Matrix multiplication
11Sahalu JunaiduICS 573: High Performance Computing5.1 Analytical Modeling of Parallel Programs Sources of Overhead in Parallel Programs Performance Metrics.
CS 584. Review n Systems of equations and finite element methods are related.
CSE351/ IT351 Modeling and Simulation
1 Systems of Linear Equations Iterative Methods. 2 B. Iterative Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
Message Passing Algorithms for Optimization
The Landscape of Ax=b Solvers Direct A = LU Iterative y’ = Ay Non- symmetric Symmetric positive definite More RobustLess Storage (if sparse) More Robust.
Iterative Solvers for Coupled Fluid-Solid Scattering Jan Mandel Work presentation Center for Aerospace Structures University of Colorado at Boulder October.
Open Methods Chapter 6 The Islamic University of Gaza
Partial differential equations Function depends on two or more independent variables This is a very simple one - there are many more complicated ones.
Monte Carlo Methods in Partial Differential Equations.
Numerical methods for PDEs PDEs are mathematical models for –Physical Phenomena Heat transfer Wave motion.
July 1, 2010Parallel solution of the Helmholtz equation1 Parallel solution of the Helmholtz equation with large wave numbers Dan Gordon Computer Science.
Computer Engineering Majors Authors: Autar Kaw
PiCAP: A Parallel and Incremental Capacitance Extraction Considering Stochastic Process Variation Fang Gong 1, Hao Yu 2, and Lei He 1 1 Electrical Engineering.
CADD: Component-Averaged Domain Decomposition Dan Gordon Computer Science University of Haifa Rachel Gordon Aerospace Engg. Technion January 13,
ParCFD Parallel computation of pollutant dispersion in industrial sites Julien Montagnier Marc Buffat David Guibert.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
Performance Measurement. A Quantitative Basis for Design n Parallel programming is an optimization problem. n Must take into account several factors:
Linear Systems Iterative Solutions CSE 541 Roger Crawfis.
Ch 2. Probability Distributions (1/2) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by Yung-Kyun Noh and Joo-kyung Kim Biointelligence.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
Lecture 7 - Systems of Equations CVEN 302 June 17, 2002.
Elliptic PDEs and the Finite Difference Method
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: ML and Simple Regression Bias of the ML Estimate Variance of the ML Estimate.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Illustration of FE algorithm on the example of 1D problem Problem: Stress and displacement analysis of a one-dimensional bar, loaded only by its own weight,
Parallelizing Gauss-Seidel Solver/Pre-conditioner Aim: To parallelize a Gauss-Seidel Solver, which can be used as a pre-conditioner for the finite element.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Linear Systems – Iterative methods
Case Study in Computational Science & Engineering - Lecture 5 1 Iterative Solution of Linear Systems Jacobi Method while not converged do { }
Domain Decomposition in High-Level Parallelizaton of PDE codes Xing Cai University of Oslo.
October 2008 Integrated Predictive Simulation System for Earthquake and Tsunami Disaster CREST/Japan Science and Technology Agency (JST)
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
We have recently implemented a microwave imaging algorithm which incorporated scalar 3D wave propagation while reconstructing a 2D dielectric property.
Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Ch 2. Probability Distributions (1/2) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by Joo-kyung Kim Biointelligence Laboratory,
Towards Future Navier-Stokes Schemes Uniform Accuracy, O(h) Time Step, Accurate Viscous/Heat Fluxes Hiroaki Nishikawa National Institute of Aerospace.
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
A Parallel Hierarchical Solver for the Poisson Equation Seung Lee Deparment of Mechanical Engineering
Adaptive grid refinement. Adaptivity in Diffpack Error estimatorError estimator Adaptive refinementAdaptive refinement A hierarchy of unstructured gridsA.
Multipole-Based Preconditioners for Sparse Linear Systems. Ananth Grama Purdue University. Supported by the National Science Foundation.
Conjugate gradient iteration One matrix-vector multiplication per iteration Two vector dot products per iteration Four n-vectors of working storage x 0.
A Scalable Parallel Preconditioned Sparse Linear System Solver Murat ManguoğluMiddle East Technical University, Turkey Joint work with: Ahmed Sameh Purdue.
1 CHAP 3 WEIGHTED RESIDUAL AND ENERGY METHOD FOR 1D PROBLEMS FINITE ELEMENT ANALYSIS AND DESIGN Nam-Ho Kim.
Relaxation Methods in the Solution of Partial Differential Equations
Xing Cai University of Oslo
Christopher Crawford PHY
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Solving Systems of Linear Equations: Iterative Methods
Solving Linear Systems Ax=b
17-Nov-18 Parallel 2D and 3D Acoustic Modeling Application for hybrid computing platform of PARAM Yuva II Abhishek Srivastava, Ashutosh Londhe*, Richa.
Christopher Crawford PHY
Supported by the National Science Foundation.
Objective Numerical methods Finite volume.
Ph.D. Thesis Numerical Solution of PDEs and Their Object-oriented Parallel Implementations Xing Cai October 26, 1998.
Presentation transcript:

July 2011 High-order schemes for high-frequency Helmholtz equation 1 Parallel solution of high-frequency Helmholtz equation using high- order finite difference schemes Dan Gordon Computer Science University of Haifa Rachel Gordon Aerospace Eng. Technion

July 2011 High-order schemes for high-frequency Helmholtz equation 2Outline  Background on Helmholtz equation  The CARP-CG parallel algorithm  Comparative results using low- and high-order finite difference schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 3 The Helmholtz Equation  Eqn: -Δu - k 2 u = g (k = "wave no.")  c = speed of sound, f = frequency  Wave length: = c/f = 2/k  No. of grid pts per : N g = /h, h= mesh size  Shifted Laplacian approach: –Bayliss, Goldstein & Turkel, 1983 –Erlangga, Vuik & Oosterlee, 2004/06 introduced imaginary shift: -Δu – ( i  k 2 u = f

July 2011 High-order schemes for high-frequency Helmholtz equation 4 The Helmholtz Equation  Some other approaches: –Elman, Ernst & O'Leary, 2001 –Plessix & Mulder, 2003 –Duff, Gratton, Pinel & Vasseeur, 2007 –Bollhöfer, Grote & Schenk, 2009 –Osei-Kuffuor & Saad, 2010  This work: hi-order schemes following –Singer & Turkel, 2006 –Erlangga & Turkel, 2011 (to appear)

July 2011 High-order schemes for high-frequency Helmholtz equation 5 Difficulties with Helmholtz  High frequencies  small diagonal  2 nd order schemes require many grid points/wavelength  "Pollution effect": high frequency requires more than fixed number of grid points/wavelength (Babuška & Sauter, 2000)   high-order schemes required

July 2011 High-order schemes for high-frequency Helmholtz equation 6 CARP: block-parallel Kaczmarz  Given: Ax=b  "Normal equations": AA T y=b, x=A T y  Kaczmarz algorithm (1937) "KACZ" is SOR on normal equations  Relaxation parameter of KACZ is the usual relax. par. of SOR  Cyclic relax. par.: each eq. gets its own relax. par.

July 2011 High-order schemes for high-frequency Helmholtz equation 7 July 1, 2010Parallel solution of the Helmholtz equation7 KACZ: Geometric Description eq. 1 eq. 2 eq. 3 initial point

July 2011 High-order schemes for high-frequency Helmholtz equation 8 CARP: Component-Averaged Row Projections  A block-parallel version of KACZ  Equations divided into blocks (not necessarily disjoint)  Initial estimate: vector x=(x 1,…,x n )  Suppose component x 1 appears in 3 blocks  x 1 is “cloned” as y 1, z 1, t 1 in the different blocks.  Perform a KACZ iteration on each block (independently, in parallel)

July 2011 High-order schemes for high-frequency Helmholtz equation 9 CARP – Explanation (cont)  The internal iterations in each block produce 3 new values for the clones of x 1 : y 1 ’, z 1 ’, t 1 ’  The next iterative value of x 1 is x 1 ’ = (y 1 ’ + z 1 ’ + t 1 ’)/3  The next iterate is x’ = (x 1 ’,..., x n ’)  Repeat iterations as needed for convergence

July 2011 High-order schemes for high-frequency Helmholtz equation 10 CARP as Domain Decomposition xx y domain A domain B external grid point of A clone of clone of x 1 Note: domains may overlap

July 2011 High-order schemes for high-frequency Helmholtz equation 11 Overview of CARP domain Adomain B KACZ iterations KACZ iterations averaging cloning KACZ in some superspace (with cyclic relaxation)

July 2011 High-order schemes for high-frequency Helmholtz equation 12 Convergence of CARP  Averaging Lemma: the component- averaging operations of CARP are equivalent to KACZ row-projections in a certain superspace (with =1)   CARP is equivalent to KACZ in the superspace, with cyclic relaxation parameters – known to converge

July 2011 High-order schemes for high-frequency Helmholtz equation 13 CARP Applications  Elliptic PDEs w/large convection term result in stiff linear systems (large off-diagonal elements) –CARP very robust on such systems, compared to leading solver & preconditioner combinations –Downside: Not always efficient  Electron tomography (ET) – joint work with J.-J. Fernández

July 2011 High-order schemes for high-frequency Helmholtz equation 14 CARP-CG: CG acceleration of CARP  CARP is KACZ in some superspace (with cyclic relaxation parameters)  Björck & Elfving (1979): developed CGMN, which is a (sequential) CG- acceleration of KACZ (double sweep, fixed relax. parameter)  We extended this result to allow cyclic relaxation parameters  Result: CARP-CG

July 2011 High-order schemes for high-frequency Helmholtz equation 15 CARP-CG: Properties  Same robustness as CARP  Very significant improvement in performance on stiff linear systems derived from elliptic PDEs  Very competitive runtime compared to leading solver/preconditioner combinations on systems derived from convection-dominated PDEs  Highly scalable on Helmholtz eqns

July 2011 High-order schemes for high-frequency Helmholtz equation 16 CARP-CG: Properties  On one processor, CARP-CG is identical to CGMN  Particularly useful on systems with LARGE off-diagonal elements –example: convection-dominated PDEs  Discontinuous coefficients are handled without requiring domain decomposition (DD)

July 2011 High-order schemes for high-frequency Helmholtz equation 17 Robustness of CARP-CG  KACZ inherently "normalizes" the eqns (eqn i is divided by ║ A i ║ 2 )  Normalization is generally useful for discontinuous coefficients  After normalization, the diagonal elements of AA T are all 1, and strictly greater than the off-diagonal elements  This is not diagonal dominance, but it makes the normal eqns manageable  Also: when diag of A decreases, sum of off-diag of AA T decreases.

July 2011 High-order schemes for high-frequency Helmholtz equation 18 Experiments with Hi-Order  Relax. par. = 1.5 for all problems  2 nd, 4 th & 6 th order central difference schemes, following –Singer & Turkel, 2006 –Erlangga & Turkel, 2011  Hi-order schemes  9-pt. stencil  Complex eqns: separated real & imag., interleaved equations (following Day & Heroux, 2001)

July 2011 High-order schemes for high-frequency Helmholtz equation 19 Problem 1 (with analytic sol'n)  Based on Erlangga & Turkel, 2011  Eqn: (Δ+k 2 )u = 0, on [-0.5,0.5]  [0,1]  bndry condition: Dirichlet on 3 sides: –u=0 for x=-0.5 and x=0.5 –u=cos(x) for y=0 –Sommerfeld: u y +iβu=0 for y=1, β 2 =k 2 -   Analytic solution: u = cos(x)exp(-iβy)  Grid points per : Ng = 9,12,15,18  Approx. 186,000 – 742,000 complex variables  One processor  k = 300

July 2011 High-order schemes for high-frequency Helmholtz equation 20 Prob. 1: rel-res for 2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 21 Prob. 1: rel-err for 2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 22 Prob. 1: rel-err for 2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 23 Problem 2 (with analytic soln)  Eqn: Δu + k 2 u = 0  Domain: [0,1][0,1]  Analytic sol'n: u=sin(x)cos(βy), β 2 =k 2 -   Dirichlet bndry cond determined by u on the boundaries  Grid points per : Ng = 9 to 18  Approx. 186,000 – 742,000 real variables  One processor  k = 300  2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 24 Prob. 2: rel-res for 2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 25 Prob. 2: rel-err for 2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 26 Prob. 2: rel-err, 6 th order, N g =9–18

July 2011 High-order schemes for high-frequency Helmholtz equation 27 Problem 3 (no analytic soln)  Eqn: Δu + k 2 u = 0  Domain: [0,1]  [0,1]  Bndry cond on y=0: discontinuity at midpt.: u(0.5,0)=1, u(x,0) = 0 for x ≠ 0 other sides: 1st order absorbing  Approx. 515,000 complex variables  Grid points per : N g = 15  One processor  k = 300  2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 28 Problem 3: evaluating the error  No analytic solution  Run 6 th order scheme to rel-res=  Saved result as “true” solution  Compared results of 2 nd, 4 th and 6 th order schemes with the “true” solution

July 2011 High-order schemes for high-frequency Helmholtz equation 29 Prob. 3: rel-err for 2 nd, 4 th, 6 th order schemes

July 2011 High-order schemes for high-frequency Helmholtz equation 30 Parallel Performance, 1 to 16 Proc. # proc Prob Prob Prob No. iter for rel-res=10 -7, 6 th order, Ng=15, ~515,000 var.

July 2011 High-order schemes for high-frequency Helmholtz equation 31 Parallel Performance, 1 to 16 Proc. # proc rel-res= rel-res= Problem 3: time (s), 6 th order scheme, Ng=15, ~515,000 var. Times taken on a 12-node cluster, 2 quad proc. per node

July 2011 High-order schemes for high-frequency Helmholtz equation 32 Prob. 2 & 3: rel-res for 1 to 16 processors

July 2011 High-order schemes for high-frequency Helmholtz equation 33 Summary  Hi-freq Helmholtz require hi-order schemes  CARP-CG is applicable to hi-freq Helmholtz with hi-order schemes  Parallel and simple  General-purpose – for problems with large off-diagonal elements and discontinuous coefficients

July 2011 High-order schemes for high-frequency Helmholtz equation 34 Other Potential Applications  Hi-order schemes for Helmholtz in homog & heterog 3D domains  Maxwell equations  Other physics equations  Saddle-point problems  Circuit problems  Linear solver in some eigenvalue methods

July 2011 High-order schemes for high-frequency Helmholtz equation 35 Publications and Software CARP: SIAM J Sci Comp 2005 CGMN: ACM Trans Math Software 2008 Microscopy: J Parallel & Distr Comp 2008 Large convection + discont coef: CMES 2009 CARP-CG: Parallel Comp 2010 Normalization for discont coef: J Comp & Appl Math 2010 CARP-CG software: THANK YOU!