Spectral analysis of complex shifted-laplace preconditioners for the Helmholtz equation
|
|
- Horace McDaniel
- 5 years ago
- Views:
Transcription
1 Spectral analysis of complex shifted-laplace preconditioners for the Helmholtz equation C. Vuik, Y.A. Erlangga, M.B. van Gijzen, and C.W. Oosterlee Delft Institute of Applied Mathematics Seminar für Analysis und Numerik Mathematisches Intitut, Universität Basel December 7, 2007, Basel, Switzerland C. Vuik, December 7, p.1/28
2 Contents 1. Introduction 2. Spectrum of shifted Laplacian preconditioners 3. Shift with an SPD real part 4. General shift 5. Numerical experiments 6. Conclusions Wim Mulder, René Edouard Plessix, Paul Urbach, Alex Kononov and Dwi Riyanti Financially supported by the Dutch Ministry of Economic Affairs: project BTS01044 C. Vuik, December 7, p.2/28
3 1. Introduction The Helmholtz problem is defined as follows where: xx u yy u z 1 k 2 (x, y)u = f, in Ω, Boundary conditions on Γ = Ω, z 1 = α 1 + iβ 1 and k(x, y) is the wavenumber for solid boundaries: Dirichlet/Neumann for fictitious boundaries: Sommerfeld du dn iku = 0 Perfectly Matched Layer (PML) Absorbing Boundary Layer (ABL) C. Vuik, December 7, p.3/28
4 Discretization In general: Finite Difference/Finite Element Methods. Particular to the present case: 5-point Finite Difference stencil, O(h 2 ). Linear system Ax = b, A C N N, b, x C N, C. Vuik, December 7, p.4/28
5 Discretization In general: Finite Difference/Finite Element Methods. Particular to the present case: 5-point Finite Difference stencil, O(h 2 ). Linear system Ax = b, A C N N, b, x C N, A is a sparse, highly indefinite matrix for practical values of k. Special property A = A T. For high resolution a very fine grid is required: grid-points per wavelength (or 5 10 k) A is extremely large! C. Vuik, December 7, p.4/28
6 Characteristic properties of the problem A C N N is sparse wavenumber k and grid size N are very large wavenumber k varies discontinuously real parts of the eigenvalues of A are positive and negative C. Vuik, December 7, p.5/28
7 Application: geophysical survey Marmousi model (hard) C. Vuik, December 7, p.6/28
8 Application: geophysical survey old method new method iterations Frequency f Marmousi model (hard) C. Vuik, December 7, p.6/28
9 2. Spectrum of shifted Laplacian preconditioners Operator based preconditioner P is based on a discrete version of xx u yy u (α 2 + iβ 2 )k 2 (x, y)u = f, in Ω. appropriate boundary conditions Matrix P 1 is approximated by an inner iteration process. α 2 = 0 β 2 = 0 Laplacian Bayliss and Turkel, 1983 α 2 = 1 β 2 = 0 Definite Helmholtz Laird, 2000 α 2 = 0 β 2 = 1 Complex Erlangga, Vuik and α 2 = 1 β 2 = 0.5 Optimal Oosterlee, 2004, 2006 C. Vuik, December 7, p.7/28
10 Spectrum of shifted Laplacian preconditioners After discretization we obtain the (un)damped Helmholtz operator L z 1 M, where L and M are SPD matrices and z 1 = α 1 + iβ 1. The preconditioner is then given by L z 2 M, where z 2 = α 2 + iβ 2 is chosen such that systems with the preconditioner are easy to solve, the outer Krylov process is accelerated significantly. C. Vuik, December 7, p.8/28
11 Spectrum of shifted Laplacian preconditioners References: Manteuffel, Parter, 1990; Yserentant, 1988 Since L and M are SPD we have the following eigenpairs Lv j = λ j Mv j, where, λ j R + The eigenvalues σ j of the preconditioned matrix satisfy Theorem 1 Provided that z 2 λ j, the relation (L z 1 M)v j = σ j (L z 2 M)v j. σ j = λ j z 1 λ j z 2 holds. C. Vuik, December 7, p.9/28
12 Spectrum of shifted Laplacian preconditioners Theorem 2 If β 2 = 0, the eigenvalues σ r + iσ i are located on the straight line in the complex plane given by β 1 σ r (α 1 α 2 )σ i = β 1. C. Vuik, December 7, p.10/28
13 Spectrum of shifted Laplacian preconditioners Theorem 2 If β 2 = 0, the eigenvalues σ r + iσ i are located on the straight line in the complex plane given by β 1 σ r (α 1 α 2 )σ i = β 1. Theorem 3 If β 2 0, the eigenvalues σ r + iσ i are on the circle in the complex plane with center c and radius R: c = z 1 z 2 z 2 z 2, R = z 2 z 1 z 2 z 2. Note that if β 1 β 2 > 0 the origin is not enclosed in the circle. C. Vuik, December 7, p.10/28
14 Spectrum of shifted Laplacian preconditioners Using Sommerfeld boundary conditions, it impossible to write the matrix as L z 1 M where, L and M are SPD. Generalized matrix L + ic z 1 M, where L, M, and C are SPD. Matrix C contains Sommerfeld boundary conditions (or other conditions: PML, ABL). Use as preconditioner L + ic z 2 M. C. Vuik, December 7, p.11/28
15 Spectrum of shifted Laplacian preconditioners Suppose then (L + ic)v = λ C Mv (L + ic z 1 M)v = σ C (L + ic z 2 M)v. Theorem 4 Let β 2 0 then the eigenvalues σ C are in or on the circle with center c = z 1 z 2 z 2 z 2 and radius R = z 2 z 1 z 2 z 2. C. Vuik, December 7, p.12/28
16 3. Shift with an SPD real part Motivation: the preconditioned system is easy to solve. 1 z1 = 1 0.5i, z2 = z1 = 1, z2 = i Im Im Re Re 1.5 z1 = 1 0.5i, z2 = 1 0.5i i 2 z1 = 1 0.5i, z2 = 1 0.5i i 1 1 Im 0.5 Im Re Re C. Vuik, December 7, p.13/28
17 Optimization of the shift Which choices for z2 are optimal? Damping: alpha2 (scaled) Damping: alpha2 (scaled) Damping: alpha2 (scaled) C. Vuik, December 7, p.14/ beta2 (scaled) beta2 (scaled) beta2 (scaled)
18 Optimal choices for z 2? beta1 = 0 beta1 = 0.1 beta1 = 0.5 beta1 = 1 Frequency: 8 50 Number of iterations imaginary shift (negative, scaled) C. Vuik, December 7, p.15/28
19 Optimal choices for z 2? Damping Optimal β 2 "optimal" iterations Minimum iterations β 1 = β 1 = β 1 = β 1 = C. Vuik, December 7, p.16/28
20 Optimal choices for z 2? Damping Optimal β 2 "optimal" iterations Minimum iterations β 1 = β 1 = β 1 = β 1 = Number of iterations h 100/2 100/4 100/8 100/16 100/32 f β 1 = β 1 = β 1 = β 1 = C. Vuik, December 7, p.16/28
21 Superlinear convergence of GMRES 10 0 f = 8. beta1 = 0, no radiation condition Scaled residual norm Number of iterations C. Vuik, December 7, p.17/28
22 Superlinear convergence of GMRES 10 0 f = 8. beta1 = 0.05, no radiation condition Scaled residual norm Number of iterations C. Vuik, December 7, p.17/28
23 Superlinear convergence of GMRES 10 0 f = 8. beta1 = 0.1, no radiation condition Scaled residual norm Number of iterations C. Vuik, December 7, p.17/28
24 4. General Shifted Laplacian preconditioner No restriction on α 2 For the outer loop α 2 = 1 and β 2 = 0 is optimal. Convergence in 1 iteration. But, the inner loop does not converge with multi-grid (original problem). However, it appears that multi-grid works well for α 2 = 1 and β 2 = 1 and the convergence of the outer loop is much faster than for the choice α 2 = 0 and β 2 = 1. C. Vuik, December 7, p.18/28
25 Eigenvalues for Complex preconditioner k = 100 and α 2 = 1 Spectrum is independent of the grid size β 2 = 1 β 2 = C. Vuik, December 7, p.19/28
26 Eigenvalues for β 1 = (damping) and α 2 = 1, β 2 = 0.5 Spectrum is independent of the grid size and the choice of k. 0.5 k = 100 k = C. Vuik, December 7, p.20/28
27 5. Numerical experiments Multi-grid components geometric multi-grid ω-jac smoother matrix dependent interpolation, restriction operator full weighting Galerkin coarse grid approximation F(1,1)-cycle P 1 is approximated by one multi-grid iteration in 3D semi-coarsening is used C. Vuik, December 7, p.21/28
28 Spectrum with inner iteration 0.6i (a) 0.5i (b) 0 0.5i i 0 1 C. Vuik, December 7, p.22/28
29 Sigsbee model depth (m) x direction (m) x C. Vuik, December 7, p.23/28
30 Sigsbee model dx = dz = m; D = m 2 ; grid points Bi-CGSTAB 5 Hz 10 Hz CPU (sec) Iter CPU (sec) Iter NO preco With preco Note: Without preconditioner, number of iterations > 10 4, With shifted Laplacian preconditioner, only 58 iterations. C. Vuik, December 7, p.24/28
31 3D wedge problem (0,0.25,1) (0,0.8,1) bk f 2 k x 3 ak (0,0.6,0) (1,0.7,0) f 1 x 2 (0,0.4,0) (1,0.2,0) x 1 Unit source C. Vuik, December 7, p.25/28
32 Numerical results for 3D wedge problem (a,b) = (1.2,1.5) (a,b) = (1.2,2.0) 60 iterations Frequency f C. Vuik, December 7, p.26/28
33 Numerical results for 3D wedge problem (a,b) = (1.2,1.5) (a,b) = (1.2,2.0) 60 iterations Frequency f C. Vuik, December 7, p.26/28
34 6. Conclusions The shifted Laplacian operator leads to robust preconditioners for the 2D and 3D Helmholtz equations with various boundary conditions. For real shifts the eigenvalues of the preconditioned operator are on a straight line. For complex shifts the eigenvalues of the preconditioned operator are on a circle. The proposed preconditioner (shifted Laplacian + multi-grid) is independent of the grid size and linearly dependent of k. With physical damping the proposed preconditioner is also independent of k. C. Vuik, December 7, p.27/28
35 Further information/research Y.A. Erlangga, C. Vuik and C.W. Oosterlee On a class of preconditioners for solving the Helmholtz equation Appl. Num. Math., 50, pp , 2004 Y.A. Erlangga, C.W. Oosterlee and C. Vuik A Novel Multigrid Based Preconditioner For Heterogeneous Helmholtz Problems SIAM J. Sci. Comput.,27, pp , 2006 M.B. van Gijzen, Y.A. Erlangga and C. Vuik Spectral analysis of the discrete Helmholtz operator preconditioned with a shifted Laplacian SIAM J. Sci. Comput., 2007, 29, pp , 2007 C. Vuik, December 7, p.28/28
On complex shifted Laplace preconditioners for the vector Helmholtz equation
On complex shifted Laplace preconditioners for the vector Helmholtz equation C. Vuik, Y.A. Erlangga, M.B. van Gijzen, C.W. Oosterlee, D. van der Heul Delft Institute of Applied Mathematics c.vuik@tudelft.nl
More informationA decade of fast and robust Helmholtz solvers
A decade of fast and robust Helmholtz solvers Werkgemeenschap Scientific Computing Spring meeting Kees Vuik May 11th, 212 1 Delft University of Technology Contents Introduction Preconditioning (22-28)
More informationA PRECONDITIONER FOR THE HELMHOLTZ EQUATION WITH PERFECTLY MATCHED LAYER
European Conference on Computational Fluid Dynamics ECCOMAS CFD 2006 P. Wesseling, E. Oñate and J. Périaux (Eds) c TU Delft, The Netherlands, 2006 A PRECONDITIONER FOR THE HELMHOLTZ EQUATION WITH PERFECTLY
More informationON A ROBUST ITERATIVE METHOD FOR HETEROGENEOUS HELMHOLTZ PROBLEMS FOR GEOPHYSICS APPLICATIONS
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 2, Supp, Pages 197 28 c 25 Institute for Scientific Computing and Information ON A ROBUST ITERATIVE METHOD FOR HETEROGENEOUS HELMHOLTZ PROBLEMS
More informationAn Efficient Two-Level Preconditioner for Multi-Frequency Wave Propagation Problems
An Efficient Two-Level Preconditioner for Multi-Frequency Wave Propagation Problems M. Baumann, and M.B. van Gijzen Email: M.M.Baumann@tudelft.nl Delft Institute of Applied Mathematics Delft University
More informationA MULTIGRID-BASED SHIFTED-LAPLACIAN PRECONDITIONER FOR A FOURTH-ORDER HELMHOLTZ DISCRETIZATION.
A MULTIGRID-BASED SHIFTED-LAPLACIAN PRECONDITIONER FOR A FOURTH-ORDER HELMHOLTZ DISCRETIZATION. N.UMETANI, S.P.MACLACHLAN, C.W. OOSTERLEE Abstract. In this paper, an iterative solution method for a fourth-order
More informationComparison of multigrid and incomplete LU shifted-laplace preconditioners for the inhomogeneous Helmholtz equation
Comparison of multigrid and incomplete LU shifted-laplace preconditioners for the inhomogeneous Helmholtz equation Y.A. Erlangga, C. Vuik, C.W. Oosterlee Delft Institute of Applied Mathematics, Delft University
More informationAN HELMHOLTZ ITERATIVE SOLVER FOR THE THREE-DIMENSIONAL SEISMIC IMAGING PROBLEMS?
European Conference on Computational Fluid Dynamics ECCOMAS CFD 2006 P. Wesseling, E. Oñate, J. Périaux (Eds) c TU Delft, Delft The Netherlands, 2006 AN HELMHOLTZ ITERATIVE SOLVER FOR THE THREE-DIMENSIONAL
More informationSolving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners
Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University of Minnesota 2 Department
More informationMultigrid absolute value preconditioning
Multigrid absolute value preconditioning Eugene Vecharynski 1 Andrew Knyazev 2 (speaker) 1 Department of Computer Science and Engineering University of Minnesota 2 Department of Mathematical and Statistical
More informationMigration with Implicit Solvers for the Time-harmonic Helmholtz
Migration with Implicit Solvers for the Time-harmonic Helmholtz Yogi A. Erlangga, Felix J. Herrmann Seismic Laboratory for Imaging and Modeling, The University of British Columbia {yerlangga,fherrmann}@eos.ubc.ca
More informationA robust computational method for the Schrödinger equation cross sections using an MG-Krylov scheme
A robust computational method for the Schrödinger equation cross sections using an MG-Krylov scheme International Conference On Preconditioning Techniques For Scientific And Industrial Applications 17-19
More informationMultigrid based preconditioners for the numerical solution of two-dimensional heterogeneous problems in geophysics
Technical Report RAL-TR-2007-002 Multigrid based preconditioners for the numerical solution of two-dimensional heterogeneous problems in geophysics I. S. Duff, S. Gratton, X. Pinel, and X. Vasseur January
More informationCONVERGENCE BOUNDS FOR PRECONDITIONED GMRES USING ELEMENT-BY-ELEMENT ESTIMATES OF THE FIELD OF VALUES
European Conference on Computational Fluid Dynamics ECCOMAS CFD 2006 P. Wesseling, E. Oñate and J. Périaux (Eds) c TU Delft, The Netherlands, 2006 CONVERGENCE BOUNDS FOR PRECONDITIONED GMRES USING ELEMENT-BY-ELEMENT
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationA fast method for the solution of the Helmholtz equation
A fast method for the solution of the Helmholtz equation Eldad Haber and Scott MacLachlan September 15, 2010 Abstract In this paper, we consider the numerical solution of the Helmholtz equation, arising
More informationElectromagnetic wave propagation. ELEC 041-Modeling and design of electromagnetic systems
Electromagnetic wave propagation ELEC 041-Modeling and design of electromagnetic systems EM wave propagation In general, open problems with a computation domain extending (in theory) to infinity not bounded
More informationarxiv: v2 [math.na] 5 Jan 2015
A SADDLE POINT NUMERICAL METHOD FOR HELMHOLT EQUATIONS RUSSELL B. RICHINS arxiv:1301.4435v2 [math.na] 5 Jan 2015 Abstract. In a previous work, the author and D.C. Dobson proposed a numerical method for
More informationIterative Helmholtz Solvers
Iterative Helmholtz Solvers Scalability of deflation-based Helmholtz solvers Delft University of Technology Vandana Dwarka March 28th, 2018 Vandana Dwarka (TU Delft) 15th Copper Mountain Conference 2018
More informationAn improved two-grid preconditioner for the solution of three-dimensional Helmholtz problems in heterogeneous media
An improved two-grid preconditioner for the solution of three-dimensional Helmholtz problems in heterogeneous media Henri Calandra, Serge Gratton, Xavier Pinel and Xavier Vasseur Technical Report TR/PA/12/2
More informationOn domain decomposition preconditioners for finite element approximations of the Helmholtz equation using absorption
On domain decomposition preconditioners for finite element approximations of the Helmholtz equation using absorption Ivan Graham and Euan Spence (Bath, UK) Collaborations with: Paul Childs (Emerson Roxar,
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. SCI. COMPUT. Vol. 27, No. 4, pp. 47 492 c 26 Society for Industrial and Applied Matematics A NOVEL MULTIGRID BASED PRECONDITIONER FOR HETEROGENEOUS HELMHOLTZ PROBLEMS Y. A. ERLANGGA, C. W. OOSTERLEE,
More informationTWO-GRID DEFLATED KRYLOV METHODS FOR LINEAR EQUATIONS
1 TWO-GRID DEFLATED KRYLOV METHODS FOR LINEAR EQUATIONS RONALD B. MORGAN AND ZHAO YANG Abstract. An approach is given for solving large linear systems that combines Krylov methods with use of two different
More informationShifted Laplace and related preconditioning for the Helmholtz equation
Shifted Laplace and related preconditioning for the Helmholtz equation Ivan Graham and Euan Spence (Bath, UK) Collaborations with: Paul Childs (Schlumberger Gould Research), Martin Gander (Geneva) Douglas
More informationVarious ways to use a second level preconditioner
Various ways to use a second level preconditioner C. Vuik 1, J.M. Tang 1, R. Nabben 2, and Y. Erlangga 3 1 Delft University of Technology Delft Institute of Applied Mathematics 2 Technische Universität
More informationThe solution of the discretized incompressible Navier-Stokes equations with iterative methods
The solution of the discretized incompressible Navier-Stokes equations with iterative methods Report 93-54 C. Vuik Technische Universiteit Delft Delft University of Technology Faculteit der Technische
More informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
More information1. Fast Iterative Solvers of SLE
1. Fast Iterative Solvers of crucial drawback of solvers discussed so far: they become slower if we discretize more accurate! now: look for possible remedies relaxation: explicit application of the multigrid
More informationPreconditioned Locally Minimal Residual Method for Computing Interior Eigenpairs of Symmetric Operators
Preconditioned Locally Minimal Residual Method for Computing Interior Eigenpairs of Symmetric Operators Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University
More informationNested Krylov methods for shifted linear systems
Nested Krylov methods for shifted linear systems M. Baumann, and M. B. van Gizen Email: M.M.Baumann@tudelft.nl Delft Institute of Applied Mathematics Delft University of Technology Delft, The Netherlands
More informationAdaptive algebraic multigrid methods in lattice computations
Adaptive algebraic multigrid methods in lattice computations Karsten Kahl Bergische Universität Wuppertal January 8, 2009 Acknowledgements Matthias Bolten, University of Wuppertal Achi Brandt, Weizmann
More informationTHEORETICAL AND NUMERICAL COMPARISON OF PROJECTION METHODS DERIVED FROM DEFLATION, DOMAIN DECOMPOSITION AND MULTIGRID METHODS
THEORETICAL AND NUMERICAL COMPARISON OF PROJECTION METHODS DERIVED FROM DEFLATION, DOMAIN DECOMPOSITION AND MULTIGRID METHODS J.M. TANG, R. NABBEN, C. VUIK, AND Y.A. ERLANGGA Abstract. For various applications,
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
More informationarxiv: v5 [math.na] 19 Mar 2014
AN EFFICIENT MULTIGRID CALCULATION OF THE FAR FIELD MAP FOR HELMHOLTZ AND SCHRÖDINGER EQUATIONS SIEGFRIED COOLS, BRAM REPS, AND WIM VANROOSE arxiv:1211.4461v5 [math.na] 19 Mar 2014 Abstract. In this paper
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationMotivation: Sparse matrices and numerical PDE's
Lecture 20: Numerical Linear Algebra #4 Iterative methods and Eigenproblems Outline 1) Motivation: beyond LU for Ax=b A little PDE's and sparse matrices A) Temperature Equation B) Poisson Equation 2) Splitting
More informationIterative Methods for Linear Systems of Equations
Iterative Methods for Linear Systems of Equations Projection methods (3) ITMAN PhD-course DTU 20-10-08 till 24-10-08 Martin van Gijzen 1 Delft University of Technology Overview day 4 Bi-Lanczos method
More informationA Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation
A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation Tao Zhao 1, Feng-Nan Hwang 2 and Xiao-Chuan Cai 3 Abstract In this paper, we develop an overlapping domain decomposition
More informationMultigrid Method for 2D Helmholtz Equation using Higher Order Finite Difference Scheme Accelerated by Krylov Subspace
201, TextRoad Publication ISSN: 2090-27 Journal of Applied Environmental and Biological Sciences www.textroad.com Multigrid Method for 2D Helmholtz Equation using Higher Order Finite Difference Scheme
More informationC. Vuik 1 R. Nabben 2 J.M. Tang 1
Deflation acceleration of block ILU preconditioned Krylov methods C. Vuik 1 R. Nabben 2 J.M. Tang 1 1 Delft University of Technology J.M. Burgerscentrum 2 Technical University Berlin Institut für Mathematik
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 16-02 The Induced Dimension Reduction method applied to convection-diffusion-reaction problems R. Astudillo and M. B. van Gijzen ISSN 1389-6520 Reports of the Delft
More information1. Introduction. We address the problem of solving a set of linear equations
SIAM J. SCI. COMPUT. Vol. 0, No. 0, pp. 000 000 c 20XX Society for Industrial and Applied Mathematics THE ITERATIVE SOLVER RISOLV WITH APPLICATION TO THE EXTERIOR HELMHOLTZ PROBLEM HILLEL TAL-EZER AND
More informationOn the choice of abstract projection vectors for second level preconditioners
On the choice of abstract projection vectors for second level preconditioners C. Vuik 1, J.M. Tang 1, and R. Nabben 2 1 Delft University of Technology 2 Technische Universität Berlin Institut für Mathematik
More informationKasetsart University Workshop. Multigrid methods: An introduction
Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA pardhan@earlham.edu A copy of these slides is available
More informationAlgebraic Multilevel Preconditioner For the Helmholtz Equation In Heterogeneous Media
Algebraic Multilevel Preconditioner For the Helmholtz Equation In Heterogeneous Media Matthias Bollhöfer Marcus J. Grote Olaf Schenk Abstract An algebraic multilevel (Ml) preconditioner is presented for
More informationAn Algebraic Multigrid Method for Eigenvalue Problems
An Algebraic Multigrid Method for Eigenvalue Problems arxiv:1503.08462v1 [math.na] 29 Mar 2015 Xiaole Han, Yunhui He, Hehu Xie and Chunguang You Abstract An algebraic multigrid method is proposed to solve
More informationThe Conjugate Gradient Method
The Conjugate Gradient Method Classical Iterations We have a problem, We assume that the matrix comes from a discretization of a PDE. The best and most popular model problem is, The matrix will be as large
More informationFast Multipole BEM for Structural Acoustics Simulation
Fast Boundary Element Methods in Industrial Applications Fast Multipole BEM for Structural Acoustics Simulation Matthias Fischer and Lothar Gaul Institut A für Mechanik, Universität Stuttgart, Germany
More informationA parameter tuning technique of a weighted Jacobi-type preconditioner and its application to supernova simulations
A parameter tuning technique of a weighted Jacobi-type preconditioner and its application to supernova simulations Akira IMAKURA Center for Computational Sciences, University of Tsukuba Joint work with
More informationUniversity of Illinois at Urbana-Champaign. Multigrid (MG) methods are used to approximate solutions to elliptic partial differential
Title: Multigrid Methods Name: Luke Olson 1 Affil./Addr.: Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 email: lukeo@illinois.edu url: http://www.cs.uiuc.edu/homes/lukeo/
More informationOUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU
Preconditioning Techniques for Solving Large Sparse Linear Systems Arnold Reusken Institut für Geometrie und Praktische Mathematik RWTH-Aachen OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative
More informationAspects of Multigrid
Aspects of Multigrid Kees Oosterlee 1,2 1 Delft University of Technology, Delft. 2 CWI, Center for Mathematics and Computer Science, Amsterdam, SIAM Chapter Workshop Day, May 30th 2018 C.W.Oosterlee (CWI)
More information9.1 Preconditioned Krylov Subspace Methods
Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 14-1 Nested Krylov methods for shifted linear systems M. Baumann and M. B. van Gizen ISSN 1389-652 Reports of the Delft Institute of Applied Mathematics Delft 214
More informationGeometric Multigrid Methods
Geometric Multigrid Methods Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University IMA Tutorial: Fast Solution Techniques November 28, 2010 Ideas
More informationA note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations
A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations S. Hussain, F. Schieweck, S. Turek Abstract In this note, we extend our recent work for
More informationDomain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions
Domain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions Ernst P. Stephan 1, Matthias Maischak 2, and Thanh Tran 3 1 Institut für Angewandte Mathematik, Leibniz
More informationThe implementation of the Helmholtz problem on a Maxeler machine
Delft University of Technology Faculty of Electrical Engineering, Mathematics and Computer Science Delft Institute of Applied Mathematics The implementation of the Helmholtz problem on a Maxeler machine
More informationSUMMARY. H (ω)u(ω,x s ;x) :=
Interpolating solutions of the Helmholtz equation with compressed sensing Tim TY Lin*, Evgeniy Lebed, Yogi A Erlangga, and Felix J Herrmann, University of British Columbia, EOS SUMMARY We present an algorithm
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 15-05 Induced Dimension Reduction method for solving linear matrix equations R. Astudillo and M. B. van Gijzen ISSN 1389-6520 Reports of the Delft Institute of Applied
More informationKey words. linear equations, eigenvalues, polynomial preconditioning, GMRES, GMRES-DR, deflation, QCD
1 POLYNOMIAL PRECONDITIONED GMRES AND GMRES-DR QUAN LIU, RONALD B. MORGAN, AND WALTER WILCOX Abstract. We look at solving large nonsymmetric systems of linear equations using polynomial preconditioned
More informationAn Angular Multigrid Acceleration Method for S n Equations with Highly Forward-Peaked Scattering
An Angular Multigrid Acceleration Method for S n Equations with Highly Forward-Peaked Scattering Bruno Turcksin & Jean C. Ragusa & Jim E. Morel Texas A&M University, Dept. of Nuclear Engineering Bruno
More informationFast Iterative Solution of Saddle Point Problems
Michele Benzi Department of Mathematics and Computer Science Emory University Atlanta, GA Acknowledgments NSF (Computational Mathematics) Maxim Olshanskii (Mech-Math, Moscow State U.) Zhen Wang (PhD student,
More informationSTEEPEST DESCENT AND CONJUGATE GRADIENT METHODS WITH VARIABLE PRECONDITIONING
SIAM J. MATRIX ANAL. APPL. Vol.?, No.?, pp.?? c 2007 Society for Industrial and Applied Mathematics STEEPEST DESCENT AND CONJUGATE GRADIENT METHODS WITH VARIABLE PRECONDITIONING ANDREW V. KNYAZEV AND ILYA
More informationOptimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms
Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms Marcus Sarkis Worcester Polytechnic Inst., Mass. and IMPA, Rio de Janeiro and Daniel
More informationNewton s Method and Efficient, Robust Variants
Newton s Method and Efficient, Robust Variants Philipp Birken University of Kassel (SFB/TRR 30) Soon: University of Lund October 7th 2013 Efficient solution of large systems of non-linear PDEs in science
More informationINTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR GRIDS. 1. Introduction
Trends in Mathematics Information Center for Mathematical Sciences Volume 9 Number 2 December 2006 Pages 0 INTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR
More informationAlgebraic multigrid and multilevel methods A general introduction. Outline. Algebraic methods: field of application
Algebraic multigrid and multilevel methods A general introduction Yvan Notay ynotay@ulbacbe Université Libre de Bruxelles Service de Métrologie Nucléaire May 2, 25, Leuven Supported by the Fonds National
More informationAMG for a Peta-scale Navier Stokes Code
AMG for a Peta-scale Navier Stokes Code James Lottes Argonne National Laboratory October 18, 2007 The Challenge Develop an AMG iterative method to solve Poisson 2 u = f discretized on highly irregular
More informationKey words. linear equations, polynomial preconditioning, nonsymmetric Lanczos, BiCGStab, IDR
POLYNOMIAL PRECONDITIONED BICGSTAB AND IDR JENNIFER A. LOE AND RONALD B. MORGAN Abstract. Polynomial preconditioning is applied to the nonsymmetric Lanczos methods BiCGStab and IDR for solving large nonsymmetric
More informationPreconditioners for the incompressible Navier Stokes equations
Preconditioners for the incompressible Navier Stokes equations C. Vuik M. ur Rehman A. Segal Delft Institute of Applied Mathematics, TU Delft, The Netherlands SIAM Conference on Computational Science and
More informationFull-Waveform Inversion with Gauss- Newton-Krylov Method
Full-Waveform Inversion with Gauss- Newton-Krylov Method Yogi A. Erlangga and Felix J. Herrmann {yerlangga,fherrmann}@eos.ubc.ca Seismic Laboratory for Imaging and Modeling The University of British Columbia
More informationThe Nullspace free eigenvalue problem and the inexact Shift and invert Lanczos method. V. Simoncini. Dipartimento di Matematica, Università di Bologna
The Nullspace free eigenvalue problem and the inexact Shift and invert Lanczos method V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The
More informationIterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems Luca Bergamaschi e-mail: berga@dmsa.unipd.it - http://www.dmsa.unipd.it/ berga Department of Mathematical Methods and Models for Scientific Applications University
More informationConvergence Behavior of a Two-Level Optimized Schwarz Preconditioner
Convergence Behavior of a Two-Level Optimized Schwarz Preconditioner Olivier Dubois 1 and Martin J. Gander 2 1 IMA, University of Minnesota, 207 Church St. SE, Minneapolis, MN 55455 dubois@ima.umn.edu
More informationA SPARSE APPROXIMATE INVERSE PRECONDITIONER FOR NONSYMMETRIC LINEAR SYSTEMS
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, SERIES B Volume 5, Number 1-2, Pages 21 30 c 2014 Institute for Scientific Computing and Information A SPARSE APPROXIMATE INVERSE PRECONDITIONER
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 11 Partial Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002.
More informationPreface to the Second Edition. Preface to the First Edition
n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................
More informationarxiv: v2 [math.na] 29 Oct 2011
arxiv:115.347v2 [math.na] 29 Oct 211 Analyzing the wave number dependency of the convergence rate of a multigrid preconditioned Krylov method for the Helmholtz equation with an absorbing layer B. Reps
More informationThe amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A.
AMSC/CMSC 661 Scientific Computing II Spring 2005 Solution of Sparse Linear Systems Part 2: Iterative methods Dianne P. O Leary c 2005 Solving Sparse Linear Systems: Iterative methods The plan: Iterative
More informationSummary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method
Summary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method Leslie Foster 11-5-2012 We will discuss the FOM (full orthogonalization method), CG,
More informationA Review of Preconditioning Techniques for Steady Incompressible Flow
Zeist 2009 p. 1/43 A Review of Preconditioning Techniques for Steady Incompressible Flow David Silvester School of Mathematics University of Manchester Zeist 2009 p. 2/43 PDEs Review : 1984 2005 Update
More informationIDR(s) A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
IDR(s) A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations Harrachov 2007 Peter Sonneveld en Martin van Gijzen August 24, 2007 1 Delft University of Technology
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 12-10 Fast linear solver for pressure computation in layered domains P. van Slingerland and C. Vuik ISSN 1389-6520 Reports of the Department of Applied Mathematical
More informationStructured Matrices, Multigrid Methods, and the Helmholtz Equation
Structured Matrices, Multigrid Methods, and the Helmholtz Equation Rainer Fischer 1, Thomas Huckle 2 Technical University of Munich, Germany Abstract Discretization of the Helmholtz equation with certain
More informationA Fast Iterative Solver for Scattering by Elastic Objects in Layered Media
A Fast Iterative Solver for Scattering by Elastic Objects in Layered Media K. Ito and J. Toivanen Center for Research in Scientific Computation, North Carolina State University, Raleigh, North Carolina
More informationConjugate gradient method. Descent method. Conjugate search direction. Conjugate Gradient Algorithm (294)
Conjugate gradient method Descent method Hestenes, Stiefel 1952 For A N N SPD In exact arithmetic, solves in N steps In real arithmetic No guaranteed stopping Often converges in many fewer than N steps
More informationPreconditioning for Nonsymmetry and Time-dependence
Preconditioning for Nonsymmetry and Time-dependence Andy Wathen Oxford University, UK joint work with Jen Pestana and Elle McDonald Jeju, Korea, 2015 p.1/24 Iterative methods For self-adjoint problems/symmetric
More informationSOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY
SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY KLAUS NEYMEYR ABSTRACT. Multigrid techniques can successfully be applied to mesh eigenvalue problems for elliptic differential operators. They allow
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:
More informationDomain decomposition on different levels of the Jacobi-Davidson method
hapter 5 Domain decomposition on different levels of the Jacobi-Davidson method Abstract Most computational work of Jacobi-Davidson [46], an iterative method suitable for computing solutions of large dimensional
More informationOn the Preconditioning of the Block Tridiagonal Linear System of Equations
On the Preconditioning of the Block Tridiagonal Linear System of Equations Davod Khojasteh Salkuyeh Department of Mathematics, University of Mohaghegh Ardabili, PO Box 179, Ardabil, Iran E-mail: khojaste@umaacir
More informationOutline. 1 Partial Differential Equations. 2 Numerical Methods for PDEs. 3 Sparse Linear Systems
Outline Partial Differential Equations Numerical Methods for PDEs Sparse Linear Systems 1 Partial Differential Equations 2 Numerical Methods for PDEs 3 Sparse Linear Systems Michael T Heath Scientific
More informationSplitting Iteration Methods for Positive Definite Linear Systems
Splitting Iteration Methods for Positive Definite Linear Systems Zhong-Zhi Bai a State Key Lab. of Sci./Engrg. Computing Inst. of Comput. Math. & Sci./Engrg. Computing Academy of Mathematics and System
More informationM.A. Botchev. September 5, 2014
Rome-Moscow school of Matrix Methods and Applied Linear Algebra 2014 A short introduction to Krylov subspaces for linear systems, matrix functions and inexact Newton methods. Plan and exercises. M.A. Botchev
More informationA New Multilevel Smoothing Method for Wavelet-Based Algebraic Multigrid Poisson Problem Solver
Journal of Microwaves, Optoelectronics and Electromagnetic Applications, Vol. 10, No.2, December 2011 379 A New Multilevel Smoothing Method for Wavelet-Based Algebraic Multigrid Poisson Problem Solver
More informationTwo-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations
Two-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations Marcella Bonazzoli 2, Victorita Dolean 1,4, Ivan G. Graham 3, Euan A. Spence 3, Pierre-Henri Tournier
More informationA Hybrid Method for the Wave Equation. beilina
A Hybrid Method for the Wave Equation http://www.math.unibas.ch/ beilina 1 The mathematical model The model problem is the wave equation 2 u t 2 = (a 2 u) + f, x Ω R 3, t > 0, (1) u(x, 0) = 0, x Ω, (2)
More informationStabilization and Acceleration of Algebraic Multigrid Method
Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration
More informationCompressive sampling meets seismic imaging
Compressive sampling meets seismic imaging Felix J. Herrmann fherrmann@eos.ubc.ca http://slim.eos.ubc.ca joint work with Tim Lin and Yogi Erlangga Seismic Laboratory for Imaging & Modeling Department of
More information