An Efficient Two-Level Preconditioner for Multi-Frequency Wave Propagation Problems
|
|
- Beverly Reed
- 5 years ago
- Views:
Transcription
1 An Efficient Two-Level Preconditioner for Multi-Frequency Wave Propagation Problems M. Baumann, and M.B. van Gijzen Delft Institute of Applied Mathematics Delft University of Technology Delft, The Netherlands May 19, 217 M. Baumann An optimal shift-and-invert preconditioner 1 / 27
2 Motivation (1/3) Seismic exploration: elastic wave equation in frequency-domain only forward problem c geophysicsrocks! Marmousi-II problem with 2,371,2 dofs 256 z [m] Solve (K + iω k C ω 2 k M)x k = b x [m] displacement at f = 6 Hz 312 1e for multiple frequencies ω k. z [m] x [m].6 M. Baumann An optimal shift-and-invert preconditioner 2 / 27
3 Motivation (1/3) Seismic exploration: elastic wave equation in frequency-domain only forward problem c geophysicsrocks! Marmousi-II problem with 2,371,2 dofs 256 z [m] Solve (K + iω k C ω 2 k M)x k = b x [m] displacement at f = 6 Hz 312 1e for multiple frequencies ω k. K, C, M z [m] x [m].6 M. Baumann An optimal shift-and-invert preconditioner 2 / 27
4 Motivation (2/3) Linearization: ([ ] [ ]) [ ] ic K M ωk x ω k I k = I x k... (K + iω k C ω 2 k M)x k = b [ ] b, k = 1,..., N ω Single preconditioner: ([ ] [ ]) 1 P(τ) 1 ic K M = τ I I [ ] [ ] [ ] I τi I I = I (K + iτc τ 2 M) 1 I ic + τm M. Baumann An optimal shift-and-invert preconditioner 3 / 27
5 Motivation (2/3) Linearization: ([ ] [ ]) [ ] ic K M ωk x ω k I k = I x k... (K + iω k C ω 2 k M)x k = b [ ] b, k = 1,..., N ω Single preconditioner: ([ ] [ ]) 1 P(τ) 1 ic K M = τ I I [ ] [ ] [ ] I τi I I = I (K + iτc τ 2 M) 1 I ic + τm M. Baumann An optimal shift-and-invert preconditioner 3 / 27
6 Motivation (3/3) Convergence behavior for two different τ. 1 1 Relative residual norm bad τ Relative residual norm good τ Number of matrix vector multiplications Number of matrix vector multiplications M. Baumann An optimal shift-and-invert preconditioner 4 / 27
7 Motivation (3/3) Convergence behavior for two different τ. 1 1 Relative residual norm bad τ Relative residual norm good τ Number of matrix vector multiplications Number of matrix vector multiplications M. Baumann An optimal shift-and-invert preconditioner 4 / 27
8 Outlook 1 The shift-and-invert preconditioner within multi-shift GMRES 2 Optimization of seed frequency τ 3 Numerical experiments Validations Shifted Neumann preconditioner Matrix equation with rotation M. Baumann An optimal shift-and-invert preconditioner 5 / 27
9 Shift-and-invert preconditioner for GMRES Want to solve A := [ ] ic K, B := I [ ] M I (A ω k B)x k = b, k = 1,..., N ω, with a single preconditioner P(τ) = (A τb): (A ω k B)P 1 k y k = b (A(A τb) 1 η k I )y k = b M. Baumann An optimal shift-and-invert preconditioner 6 / 27
10 Shift-and-invert preconditioner for GMRES Want to solve A := [ ] ic K, B := I [ ] M I (A ω k B)x k = b, k = 1,..., N ω, with a single preconditioner P(τ) = (A τb): (A ω k B)P 1 k y k = b (A(A τb) 1 η k I )y k = b M. Baumann An optimal shift-and-invert preconditioner 6 / 27
11 Shift-and-invert preconditioner for GMRES Want to solve A := [ ] ic K, B := I [ ] M I (A ω k B)x k = b, k = 1,..., N ω, with a single preconditioner P(τ) = (A τb): (A ω k B)P 1 k y k = b ( C η k I )y k = b M. Baumann An optimal shift-and-invert preconditioner 6 / 27
12 Multi-shift GMRES... Did you know? For shifted problems, (C η k I )y k = b, k = 1,..., N ω, Krylov spaces are shift-invariant K m (C, b) K m (C ηi, b) η C. Multi-shift GMRES: (C η k I )V m = V m+1 (H m η k I) Reference A. Frommer and U. Glässner. Restarted GMRES for Shifted Linear Systems. SIAM J. Sci. Comput., 19(1), (1998) M. Baumann An optimal shift-and-invert preconditioner 7 / 27
13 Multi-shift GMRES... Did you know? For shifted problems, (C η k I )y k = b, k = 1,..., N ω, Krylov spaces are shift-invariant K m (C, b) K m (C ηi, b) η C. Multi-shift GMRES: (C η k I )V m = V m+1 (H m η k I) Reference A. Frommer and U. Glässner. Restarted GMRES for Shifted Linear Systems. SIAM J. Sci. Comput., 19(1), (1998) M. Baumann An optimal shift-and-invert preconditioner 7 / 27
14 Optimization of seed frequency ( A(A τb) 1 ω ) k ω k τ I y k = b Theorem: GMRES convergence bound [Saad, Iter. Methods] Let the eigenvalues of a matrix be enclosed by a circle with radius R and center c. Then the GMRES-residual norm after i iterations r (i) satisfies, r (i) ( ) R(τ) i r () c 2(X ), c(τ) where X is the matrix of eigenvectors, and c 2 (X ) its condition number in the 2-norm. M. Baumann An optimal shift-and-invert preconditioner 8 / 27
15 Optimization of seed frequency ( A(A τb) 1 ω ) k ω k τ I y k = b Theorem: msgmres convergence bound [Saad, Iter. Methods] Let the eigenvalues of a matrix be enclosed by a circle with radius R k and center c k. Then the GMRES-residual norm after i iterations r (i) k satisfies, r (i) k ( ) r () c Rk (τ) i 2(X ), k = 1,..., N ω, c k (τ) where X is the matrix of eigenvectors, and c 2 (X ) its condition number in the 2-norm. M. Baumann An optimal shift-and-invert preconditioner 8 / 27
16 The preconditioned spectra no damping N ω = imag part real part M. Baumann An optimal shift-and-invert preconditioner 9 / 27
17 The preconditioned spectra no damping N ω = 5 1 imag part.5 R c k real part M. Baumann An optimal shift-and-invert preconditioner 9 / 27
18 The preconditioned spectra with damping ɛ > ˆω k := (1 ɛi)ω k imag part real part M. Baumann An optimal shift-and-invert preconditioner 9 / 27
19 The preconditioned spectra with damping ɛ > ˆω k := (1 ɛi)ω k 2 R(τ) c k c k imag part 1 c R ϕ k.5 c real part M. Baumann An optimal shift-and-invert preconditioner 1 / 27
20 The preconditioned spectra Lemma: Optimal seed shift for msgmres [B/vG, 216] (i) For λ Λ[AB 1 ] it holds I(λ). (ii) The preconditioned spectra are enclosed by circles of radii R k and center points c k. (iii) The points {c k } Nω k=1 C described in statement (ii) lie on a circle with center c and radius R. (iv) Consider the preconditioner P(τ ) = A τ B. An optimal seed frequency τ for preconditioned multi-shift GMRES is given by, ( ) τ (ɛ) = min max Rk (τ) =... = τ C k=1,..,n ω c k = 2ω1ω N ω i ω 1 + ω Nω [ɛ2 (ω 1 + ω Nω ) 2 + (ω Nω ω 1) 2 ] ω 1ω Nω ω 1 + ω Nω M. Baumann An optimal shift-and-invert preconditioner 11 / 27
21 The preconditioned spectra Proof (1/4) Proof. (i) We have to show I(ω) for, [ ] ic K x = ω I [ ] M x I or, alternatively (λ = iω), consider the QEP, (K + λc + λ 2 M)v =. R(λ) I(ω) M. Baumann An optimal shift-and-invert preconditioner 12 / 27
22 The preconditioned spectra Proof (1/4) Proof. (i) We have to show I(ω) for, [ ] ic K x = ω I [ ] M x I or, alternatively (λ = iω), consider the QEP, (K + λc + λ 2 M)v =. R(λ) I(ω) M. Baumann An optimal shift-and-invert preconditioner 12 / 27
23 The preconditioned spectra Proof (2/4) (ii) The preconditioned spectra are enclosed by circles. Factor out AB 1, C η k I = A(A τb) 1 η k I = AB 1 (AB 1 τi ) 1 η k I, and note that Λ[AB 1 ] λ is a Möbius transformation ( ). λ λ τ ω k ω k τ, Reference M.B. van Gijzen, Y.A. Erlangga, C. Vuik. Spectral Analysis of the Discrete Helmholtz Operator Preconditioned with a Shifted Laplacian. SIAM J. Sci. Comput., 29(5), (27) ( ) : z az+b cz+d M. Baumann An optimal shift-and-invert preconditioner 13 / 27
24 The preconditioned spectra Proof (3/4) (iii) Spectra are bounded by circles (c k, R). These center point {c k } Nω k=1 lie on a big circle (c, R). 1. Construct center: ( ɛ τ 2 ) c =, C 2I(τ)(I(τ) + ɛr(τ)) 2. A point c k has constant distance to c: R 2 = c k c 2 2 = τ 2 (ɛ 2 + 1) 4(I(τ) + ɛr(τ)) 2 (independent of ω k ) M. Baumann An optimal shift-and-invert preconditioner 14 / 27
25 The preconditioned spectra with damping ɛ > ˆω k := (1 ɛi)ω k 2 R(τ) c k c k imag part 1 c R ϕ k.5 c real part M. Baumann An optimal shift-and-invert preconditioner 15 / 27
26 The preconditioned spectra Proof (4/4) 1. (iv) Find optimal τ τ = min max τ C k=1,..,n ω 1 c k = f (c, R, ϕ k ) ( ) R c k 2 polar coordinates 3 τ ϕ = (optimize along ϕ) imag part (relative) τ ˆω min ˆω max real part (relative).64 M. Baumann An optimal shift-and-invert preconditioner 16 / 27
27 The preconditioned spectra Proof (4/4) 1. (iv) Find optimal τ τ = min max τ C k {1,N ω} 1 c k = f (c, R, ϕ k ) ( ) R c k 2 polar coordinates 3 τ ϕ = (optimize along ϕ) imag part (relative) τ ˆω min ˆω max real part (relative).64 M. Baumann An optimal shift-and-invert preconditioner 16 / 27
28 The preconditioned spectra Proof (4/4) 1. (iv) Find optimal τ τ = min max τ C k {1,N ω} 1 c k = f (c, R, ϕ k ) ( ) R c k 2 polar coordinates 3 τ ϕ = (optimize along ϕ) imag part (relative) τ ˆω min ˆω max real part (relative).64 τ = 2ω 1ω Nω ω 1 +ω Nω [ɛ i 2 (ω 1 +ω Nω ) 2 +(ω Nω ω 1 ) 2 ]ω 1 ω Nω ω 1 +ω Nω M. Baumann An optimal shift-and-invert preconditioner 16 / 27
29 1 The shift-and-invert preconditioner within multi-shift GMRES 2 Optimization of seed frequency τ 3 Numerical experiments Validations Shifted Neumann preconditioner Matrix equation with rotation M. Baumann An optimal shift-and-invert preconditioner 17 / 27
30 The (damped) time-harmonic elastic wave equation Continuous setting Elastic wave equation Discrete setting Solve ˆω k = (1 ɛi)ω k ωk 2 ρ(x)u k σ(u k ) = s with boundary conditions iω k ρ(x)bu k + σ(u k )ˆn =, σ(u k )ˆn =, on Ω a Ω r. (K + iω k C ωk 2 M)u k = s with FEM matrices K ij = σ(ϕ i ) : ϕ j dω, Ω M ij = ρ(x)ϕ i ϕ j dω, Ω C ij = ρ(x)bϕ i ϕ j dγ. Ω a nutils M. Baumann An optimal shift-and-invert preconditioner 18 / 27
31 The (damped) time-harmonic elastic wave equation Continuous setting Elastic wave equation Discrete setting Solve ˆω k = (1 ɛi)ω k ωk 2 ρ(x)u k σ(u k ) = s with boundary conditions iω k ρ(x)bu k + σ(u k )ˆn =, σ(u k )ˆn =, on Ω a Ω r. (K + iω k C ωk 2 M)u k = s with FEM matrices K ij = σ(ϕ i ) : ϕ j dω, Ω M ij = ρ(x)ϕ i ϕ j dω, Ω C ij = ρ(x)bϕ i ϕ j dγ. Ω a nutils M. Baumann An optimal shift-and-invert preconditioner 18 / 27
32 Numerical experiments Validations and second-level preconditioners Set-up: An elastic wedge problem. Density 21 u_z at 16. Hz 1e u_x at 24. Hz 1e z [m] 195 z [m].8 z [m] x [m] x [m] x [m] M. Baumann An optimal shift-and-invert preconditioner 19 / 27
33 Numerical experiments (1/4) Validations I τ (ɛ) = ω 1 ω Nω (1 + ɛ 2 ) e i arctan ( ) ɛ 2 (ω 1 +ω Nω ) 2 +(ω Nω ω 1 ) 2 4ω 1 ω Nω ω min /2π [Hz] ω max /2π [Hz] N ω # iterations CPU time [s] damping factor ɛ =.5 #dofs = 48, 642 (Q 1 finite elements) M. Baumann An optimal shift-and-invert preconditioner 2 / 27
34 Numerical experiments (2/4) Validations II 1 1 N ω = 5 Convergence behavior: ω min and ω max converge slowest, smallest factor R/ c k yields fastest convergence, inner frequencies for free. Relative residual norm Number of matrix vector multiplications M. Baumann An optimal shift-and-invert preconditioner 21 / 27
35 Numerical experiments (3/4) Shifted Neumann preconditioner Apply a Neumann polynomial preconditioner of degree n ɛ =.5 ɛ =.3 ɛ =.1 ɛ = Number of iterations 8 6 Number of iterations ɛ =.5 ɛ =.3 ɛ =.1 ɛ = Seed shift (scaled imag part) Seed shift (scaled imag part) case n = case n = 5 M. Baumann An optimal shift-and-invert preconditioner 22 / 27
36 Numerical experiments (4/4) Matrix equation with rotation Solve matrix equation, A(X) := KX + icxω MXΩ 2 = B. Spectrum of A P imag part real part M. Baumann An optimal shift-and-invert preconditioner 23 / 27
37 Numerical experiments (4/4) Matrix equation with rotation Solve matrix equation, A(X) := KX + icxω MXΩ 2 = B. Spectrum of A P 1 1 P e i(φ 2 φ 1 ) 1. imag part real part M. Baumann An optimal shift-and-invert preconditioner 23 / 27
38 Summary Relative residual norm bad τ Number of matrix vector multiplications Relative residual norm good τ Number of matrix vector multiplications M. Baumann An optimal shift-and-invert preconditioner 24 / 27
39 Summary Relative residual norm bad τ Number of matrix vector multiplications Relative residual norm good τ Number of matrix vector multiplications M. Baumann An optimal shift-and-invert preconditioner 24 / 27
40 Conclusions Optimal shift-and-invert preconditioner for msgmres. Second level: Shifted Neumann preconditioner & rotations in matrix equation approach. For multi-core CPUs: Splitting strategy of frequency range. Optimality for ɛ = only by continuity.? Relation to pole selection in rational Krylov methods. Thank you for your attention! M. Baumann An optimal shift-and-invert preconditioner 25 / 27
41 Conclusions Optimal shift-and-invert preconditioner for msgmres. Second level: Shifted Neumann preconditioner & rotations in matrix equation approach. For multi-core CPUs: Splitting strategy of frequency range. Optimality for ɛ = only by continuity.? Relation to pole selection in rational Krylov methods. Thank you for your attention! M. Baumann An optimal shift-and-invert preconditioner 25 / 27
42 References M. Baumann and M.B. van Gijzen. Nested Krylov methods for shifted linear systems. SIAM J. Sci. Comput., 37(5), S9-S112 (215). M. Baumann, R. Astudillo, Y. Qiu, E. Ang, M.B. van Gijzen, and R.-E. Plessix. An MSSS-Preconditioned Matrix Equation Approach for the Time-Harmonic Elastic Wave Equation at Multiple Frequencies. DIAM Technical Report 16-4, TU Delft [accepted]. M. Baumann and M.B. van Gijzen. Efficient iterative methods for multi-frequency wave propagation problems: A comparison study. Proceedings of ICCS 217 [accepted]. M. Baumann and M.B. van Gijzen. An Efficient Two-Level Preconditioner for Multi-Frequency Wave Propagation Problems. DIAM Technical Report 17-3, TU Delft [under review]. Research funded by Shell. M. Baumann An optimal shift-and-invert preconditioner 26 / 27
43 Finite element discretization in Python FEM discretization of stiffness matrix K, K ij = σ(ϕ i ) : ϕ j dω, where Ω ( ) σ(ϕ i ) = λ(x)div(ϕ i )I 3 + µ(x) ϕ i + ( ϕ i ) T, becomes in nutils: ndims = 3 phi = domain.splinefunc(degree=2).vector(ndims) stress = lambda u: lam*u.div(geom)[:,_,_]*function.eye(ndims) + mu*u.symgrad(geom) elast = function.outer( stress(phi), phi.grad(geom) ).sum([2,3]) K = domain.integrate(elast, geometry=geom, ischeme= gauss2 ) Go back M. Baumann An optimal shift-and-invert preconditioner 27 / 27
Nested 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 informationSpectral analysis of complex shifted-laplace preconditioners for the Helmholtz equation
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 c.vuik@tudelft.nl
More informationOn 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 informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 16-4 An MSSS-Preconditioned Matrix Equation Approach for the Time-Harmonic Elastic Wave Equation at Multiple Frequencies M. Baumann, R. Astudillo, Y. Qiu, E. Ang,
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 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 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 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 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 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 informationA comparison of solvers for quadratic eigenvalue problems from combustion
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS [Version: 2002/09/18 v1.01] A comparison of solvers for quadratic eigenvalue problems from combustion C. Sensiau 1, F. Nicoud 2,, M. van Gijzen 3,
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
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 informationInduced Dimension Reduction method to solve the Quadratic Eigenvalue Problem
Induced Dimension Reduction method to solve the Quadratic Eigenvalue Problem R. Astudillo and M. B. van Gijzen Email: R.A.Astudillo@tudelft.nl Delft Institute of Applied Mathematics Delft University of
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 informationFEM and Sparse Linear System Solving
FEM & sparse system solving, Lecture 7, Nov 3, 2017 1/46 Lecture 7, Nov 3, 2015: Introduction to Iterative Solvers: Stationary Methods http://people.inf.ethz.ch/arbenz/fem16 Peter Arbenz Computer Science
More informationParallel Numerics, WT 2016/ Iterative Methods for Sparse Linear Systems of Equations. page 1 of 1
Parallel Numerics, WT 2016/2017 5 Iterative Methods for Sparse Linear Systems of Equations page 1 of 1 Contents 1 Introduction 1.1 Computer Science Aspects 1.2 Numerical Problems 1.3 Graphs 1.4 Loop Manipulations
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 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 informationAlgorithms that use the Arnoldi Basis
AMSC 600 /CMSC 760 Advanced Linear Numerical Analysis Fall 2007 Arnoldi Methods Dianne P. O Leary c 2006, 2007 Algorithms that use the Arnoldi Basis Reference: Chapter 6 of Saad The Arnoldi Basis How to
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 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 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 informationPreconditioned inverse iteration and shift-invert Arnoldi method
Preconditioned inverse iteration and shift-invert Arnoldi method Melina Freitag Department of Mathematical Sciences University of Bath CSC Seminar Max-Planck-Institute for Dynamics of Complex Technical
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 informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More informationClassical iterative methods for linear systems
Classical iterative methods for linear systems Ed Bueler MATH 615 Numerical Analysis of Differential Equations 27 February 1 March, 2017 Ed Bueler (MATH 615 NADEs) Classical iterative methods for linear
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 informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
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 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 informationIntroduction to Iterative Solvers of Linear Systems
Introduction to Iterative Solvers of Linear Systems SFB Training Event January 2012 Prof. Dr. Andreas Frommer Typeset by Lukas Krämer, Simon-Wolfgang Mages and Rudolf Rödl 1 Classes of Matrices and their
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 informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNVESTY OF TECHNOLOGY EPOT - Convergence Analysis of Multilevel Sequentially Semiseparable Preconditioners Yue Qiu, Martin B. van Gijzen, Jan-Willem van Wingerden Michel Verhaegen, and Cornelis Vui
More informationA Jacobi Davidson Method for Nonlinear Eigenproblems
A Jacobi Davidson Method for Nonlinear Eigenproblems Heinrich Voss Section of Mathematics, Hamburg University of Technology, D 21071 Hamburg voss @ tu-harburg.de http://www.tu-harburg.de/mat/hp/voss Abstract.
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 informationAn Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems
An Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems H. Voss 1 Introduction In this paper we consider the nonlinear eigenvalue problem T (λ)x = 0 (1) where T (λ) R n n is a family of symmetric
More informationNumerical Methods - Numerical Linear Algebra
Numerical Methods - Numerical Linear Algebra Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Numerical Linear Algebra I 2013 1 / 62 Outline 1 Motivation 2 Solving Linear
More informationSolving Ax = b, an overview. Program
Numerical Linear Algebra Improving iterative solvers: preconditioning, deflation, numerical software and parallelisation Gerard Sleijpen and Martin van Gijzen November 29, 27 Solving Ax = b, an overview
More informationPerformance comparison between hybridizable DG and classical DG methods for elastic waves simulation in harmonic domain
March 4-5, 2015 Performance comparison between hybridizable DG and classical DG methods for elastic waves simulation in harmonic domain M. Bonnasse-Gahot 1,2, H. Calandra 3, J. Diaz 1 and S. Lanteri 2
More informationMath Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
More informationOn the interplay between discretization and preconditioning of Krylov subspace methods
On the interplay between discretization and preconditioning of Krylov subspace methods Josef Málek and Zdeněk Strakoš Nečas Center for Mathematical Modeling Charles University in Prague and Czech Academy
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 informationA Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems
A Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems Mario Arioli m.arioli@rl.ac.uk CCLRC-Rutherford Appleton Laboratory with Daniel Ruiz (E.N.S.E.E.I.H.T)
More informationSolving Sparse Linear Systems: Iterative methods
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccs Lecture Notes for Unit VII Sparse Matrix Computations Part 2: Iterative Methods Dianne P. O Leary c 2008,2010
More informationSolving Sparse Linear Systems: Iterative methods
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 2: Iterative Methods Dianne P. O Leary
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 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 informationIterative methods for Linear System
Iterative methods for Linear System JASS 2009 Student: Rishi Patil Advisor: Prof. Thomas Huckle Outline Basics: Matrices and their properties Eigenvalues, Condition Number Iterative Methods Direct and
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 informationEXAMPLES OF CLASSICAL ITERATIVE METHODS
EXAMPLES OF CLASSICAL ITERATIVE METHODS In these lecture notes we revisit a few classical fixpoint iterations for the solution of the linear systems of equations. We focus on the algebraic and algorithmic
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 positive definite linear systems with a complex shift
Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution
More informationLab 1: Iterative Methods for Solving Linear Systems
Lab 1: Iterative Methods for Solving Linear Systems January 22, 2017 Introduction Many real world applications require the solution to very large and sparse linear systems where direct methods such as
More informationFine-Grained Parallel Algorithms for Incomplete Factorization Preconditioning
Fine-Grained Parallel Algorithms for Incomplete Factorization Preconditioning Edmond Chow School of Computational Science and Engineering Georgia Institute of Technology, USA SPPEXA Symposium TU München,
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 11-14 On the convergence of inexact Newton methods R. Idema, D.J.P. Lahaye, and C. Vuik ISSN 1389-6520 Reports of the Department of Applied Mathematical Analysis Delft
More informationNonlinear Eigenvalue Problems: An Introduction
Nonlinear Eigenvalue Problems: An Introduction Cedric Effenberger Seminar for Applied Mathematics ETH Zurich Pro*Doc Workshop Disentis, August 18 21, 2010 Cedric Effenberger (SAM, ETHZ) NLEVPs: An Introduction
More informationRecent advances in approximation using Krylov subspaces. V. Simoncini. Dipartimento di Matematica, Università di Bologna.
Recent advances in approximation using Krylov subspaces V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The framework It is given an operator
More informationOn the Ritz values of normal matrices
On the Ritz values of normal matrices Zvonimir Bujanović Faculty of Science Department of Mathematics University of Zagreb June 13, 2011 ApplMath11 7th Conference on Applied Mathematics and Scientific
More informationIterative methods for Linear System of Equations. Joint Advanced Student School (JASS-2009)
Iterative methods for Linear System of Equations Joint Advanced Student School (JASS-2009) Course #2: Numerical Simulation - from Models to Software Introduction In numerical simulation, Partial Differential
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 informationOn deflation and singular symmetric positive semi-definite matrices
Journal of Computational and Applied Mathematics 206 (2007) 603 614 www.elsevier.com/locate/cam On deflation and singular symmetric positive semi-definite matrices J.M. Tang, C. Vuik Faculty of Electrical
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 informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2017/18 Part 3: Iterative Methods PD
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 informationWeek Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2,
Math 051 W008 Margo Kondratieva Week 10-11 Quadratic forms Principal axes theorem Text reference: this material corresponds to parts of sections 55, 8, 83 89 Section 41 Motivation and introduction Consider
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 informationEFFICIENT PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION PROBLEM WITH A MULTILEVEL SEQUENTIALLY SEMISEPARABLE MATRIX STRUCTURE
Electronic Transactions on Numerical Analysis. Volume 44, pp. 367 4, 215. Copyright c 215,. ISSN 168 9613. ETNA EFFICIENT PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION PROBLEM WITH A MULTILEVEL SEQUENTIALLY
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 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 informationSUMMARY REVIEW OF THE FREQUENCY DOMAIN L2 FWI-HESSIAN
Efficient stochastic Hessian estimation for full waveform inversion Lucas A. Willemsen, Alison E. Malcolm and Russell J. Hewett, Massachusetts Institute of Technology SUMMARY In this abstract we present
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 informationSolution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method
Solution of eigenvalue problems Introduction motivation Projection methods for eigenvalue problems Subspace iteration, The symmetric Lanczos algorithm Nonsymmetric Lanczos procedure; Implicit restarts
More informationFEM and sparse linear system solving
FEM & sparse linear system solving, Lecture 9, Nov 19, 2017 1/36 Lecture 9, Nov 17, 2017: Krylov space methods http://people.inf.ethz.ch/arbenz/fem17 Peter Arbenz Computer Science Department, ETH Zürich
More informationOn the solution of large Sylvester-observer equations
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 200; 8: 6 [Version: 2000/03/22 v.0] On the solution of large Sylvester-observer equations D. Calvetti, B. Lewis 2, and L. Reichel
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 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 informationBETI for acoustic and electromagnetic scattering
BETI for acoustic and electromagnetic scattering O. Steinbach, M. Windisch Institut für Numerische Mathematik Technische Universität Graz Oberwolfach 18. Februar 2010 FWF-Project: Data-sparse Boundary
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 informationTopics. The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems
Topics The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems What about non-spd systems? Methods requiring small history Methods requiring large history Summary of solvers 1 / 52 Conjugate
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 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 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 informationSemi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations
Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Sunyoung Bu University of North Carolina Department of Mathematics CB # 325, Chapel Hill USA agatha@email.unc.edu Jingfang
More informationScientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1
Scientific Computing WS 2018/2019 Lecture 9 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 9 Slide 1 Lecture 9 Slide 2 Simple iteration with preconditioning Idea: Aû = b iterative scheme û = û
More informationSpectral element agglomerate AMGe
Spectral element agglomerate AMGe T. Chartier 1, R. Falgout 2, V. E. Henson 2, J. E. Jones 4, T. A. Manteuffel 3, S. F. McCormick 3, J. W. Ruge 3, and P. S. Vassilevski 2 1 Department of Mathematics, Davidson
More informationA STUDY OF MULTIGRID SMOOTHERS USED IN COMPRESSIBLE CFD BASED ON THE CONVECTION DIFFUSION EQUATION
ECCOMAS Congress 2016 VII European Congress on Computational Methods in Applied Sciences and Engineering M. Papadrakakis, V. Papadopoulos, G. Stefanou, V. Plevris (eds.) Crete Island, Greece, 5 10 June
More informationBackground. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58
Background C. T. Kelley NC State University tim kelley@ncsu.edu C. T. Kelley Background NCSU, Spring 2012 1 / 58 Notation vectors, matrices, norms l 1 : max col sum... spectral radius scaled integral norms
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 informationBoundary Value Problems - Solving 3-D Finite-Difference problems Jacob White
Introduction to Simulation - Lecture 2 Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy Outline Reminder about
More informationThe rational Krylov subspace for parameter dependent systems. V. Simoncini
The rational Krylov subspace for parameter dependent systems V. Simoncini Dipartimento di Matematica, Università di Bologna valeria.simoncini@unibo.it 1 Given the continuous-time system Motivation. Model
More informationStochastic Elastic-Plastic Finite Element Method for Performance Risk Simulations
Stochastic Elastic-Plastic Finite Element Method for Performance Risk Simulations Boris Jeremić 1 Kallol Sett 2 1 University of California, Davis 2 University of Akron, Ohio ICASP Zürich, Switzerland August
More informationMICHIEL E. HOCHSTENBACH
VARIATIONS ON HARMONIC RAYLEIGH RITZ FOR STANDARD AND GENERALIZED EIGENPROBLEMS MICHIEL E. HOCHSTENBACH Abstract. We present several variations on the harmonic Rayleigh Ritz method. First, we introduce
More informationDesign of Structures for Earthquake Resistance
NATIONAL TECHNICAL UNIVERSITY OF ATHENS Design of Structures for Earthquake Resistance Basic principles Ioannis N. Psycharis Lecture 3 MDOF systems Equation of motion M u + C u + K u = M r x g(t) where:
More informationFast iterative BEM for high-frequency scattering
Fast iterative BEM for high-frequency scattering elastodynamic problems In 3D. Marion Darbas LAMFA UMR CNRS 7352, Amiens, France S. Chaillat (POEMS, CNRS-INRIA-ENSTA) and F. Le Louër (LMAC, UTC) Conference
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 informationSIMULTANEOUS DETERMINATION OF STEADY TEMPERATURES AND HEAT FLUXES ON SURFACES OF THREE DIMENSIONAL OBJECTS USING FEM
Proceedings of ASME IMECE New ork, N, November -6, IMECE/HTD-43 SIMULTANEOUS DETERMINATION OF STEAD TEMPERATURES AND HEAT FLUES ON SURFACES OF THREE DIMENSIONAL OBJECTS USING FEM Brian H. Dennis and George
More informationThe parallel computation of the smallest eigenpair of an. acoustic problem with damping. Martin B. van Gijzen and Femke A. Raeven.
The parallel computation of the smallest eigenpair of an acoustic problem with damping. Martin B. van Gijzen and Femke A. Raeven Abstract Acoustic problems with damping may give rise to large quadratic
More informationILAS 2017 July 25, 2017
Polynomial and rational filtering for eigenvalue problems and the EVSL project Yousef Saad Department of Computer Science and Engineering University of Minnesota ILAS 217 July 25, 217 Large eigenvalue
More information