Nested Krylov methods for shifted linear systems
|
|
- Oswald Lynch
- 6 years ago
- Views:
Transcription
1 Nested Krylov methods for shifted linear systems M. Baumann, and M. B. van Gizen Delft Institute of Applied Mathematics Delft University of Technology Delft, The Netherlands University of Wuppertal - September 25, 2014 M. Baumann () Nested Krylov methods for shifted systems 1 / 27
2 Motivation Full-waveform inversion PDE-constrained optimization: min u sim u meas, ρ(x),c p(x),c s(x) where in our application: u sim is the (numerical) solution of the elastic wave equation, u meas is obtained from measurements, ρ(x) is the density of the earth layers we are interested in. The modelling is done in frequency-domain... M. Baumann () Nested Krylov methods for shifted systems 2 / 27
3 Motivation Modelling in frequency-domain Frequency-domain approach: The time-harmonic elastic wave equation For many (angular) frequencies ω k, we solve ωk 2 ρ(x)û σ(û, c p, c s ) = ŝ, x Ω R 2,3, together with absorbing or reflecting boundary conditions. Inverse (discrete) Fourier transform: u(x, t) = k û(x, ω k )e iω kt M. Baumann () Nested Krylov methods for shifted systems 3 / 27
4 Motivation Shifted linear systems The discretized time-harmonic elastic wave equation is quadratic in ω k : (K + iω k C ωk 2 M)û = ŝ, which can be re-arranged as, [( im 1 C M 1 ) ( )] ( ) ( K I 0 ωk û M 1ŝ ) ω I 0 k =. 0 I û 0 The latter is of the form: (A ω k I )x k = b, k = 1,..., N. movie M. Baumann () Nested Krylov methods for shifted systems 4 / 27
5 Motivation Shifted linear systems The discretized time-harmonic elastic wave equation is quadratic in ω k : (K + iω k C ωk 2 M)û = ŝ, which can be re-arranged as, [( im 1 C M 1 ) ( )] ( ) ( K I 0 ωk û M 1ŝ ) ω I 0 k =. 0 I û 0 The latter is of the form: (A ω k I )x k = b, k = 1,..., N. movie M. Baumann () Nested Krylov methods for shifted systems 4 / 27
6 Outline 1 Introduction 2 Multi-shift Krylov methods 3 Polynomial preconditioners 4 Nested multi-shift Krylov methods 5 Numerical results 6 Summary M. Baumann () Nested Krylov methods for shifted systems 5 / 27
7 What s a shifted linear system? Definition Shifted linear systems are of the form where ω C is the shift. (A ωi )x (ω) = b, For the simultaneous solution, Krylov methods are well-suited because of the shift-invariance property: K m (A, b) span{b, Ab,..., A m 1 b} = K m (A ωi, b). Proof (shift-invariance) For m = 2: K 2 (A, b) = span{b, Ab} K 2 (A ωi, b) = span{b, Ab ωb} = span{b, Ab} M. Baumann () Nested Krylov methods for shifted systems 6 / 27
8 What s a shifted linear system? Definition Shifted linear systems are of the form where ω C is the shift. (A ωi )x (ω) = b, For the simultaneous solution, Krylov methods are well-suited because of the shift-invariance property: K m (A, b) span{b, Ab,..., A m 1 b} = K m (A ωi, b). Proof (shift-invariance) For m = 2: K 2 (A, b) = span{b, Ab} K 2 (A ωi, b) = span{b, Ab ωb} = span{b, Ab} M. Baumann () Nested Krylov methods for shifted systems 6 / 27
9 What s a shifted linear system? Definition Shifted linear systems are of the form where ω C is the shift. (A ωi )x (ω) = b, For the simultaneous solution, Krylov methods are well-suited because of the shift-invariance property: K m (A, b) span{b, Ab,..., A m 1 b} = K m (A ωi, b). Proof (shift-invariance) For m = 2: K 2 (A, b) = span{b, Ab} K 2 (A ωi, b) = span{b, Ab ωb} = span{b, Ab} M. Baumann () Nested Krylov methods for shifted systems 6 / 27
10 For example, multi-shift GMRES After m steps of Arnoldi, we have, AV m = V m+1 H m, and the approximate solution yields: x m V m y m, where y m = argmin y C m H m y b e 1. For shifted systems, we get and, therefore, x (ω) m (A ωi )V m = V m+1 (H m ωi m ), V m y m (ω), where y m (ω) = argmin y C m H (ω) m y b e 1. M. Baumann () Nested Krylov methods for shifted systems 7 / 27
11 For example, multi-shift GMRES After m steps of Arnoldi, we have, AV m = V m+1 H m, and the approximate solution yields: x m V m y m, where y m = argmin y C m H m y b e 1. For shifted systems, we get and, therefore, x (ω) m (A ωi )V m = V m+1 (H m ωi m ), V m y m (ω), where y m (ω) = argmin y C m H (ω) m y b e 1. M. Baumann () Nested Krylov methods for shifted systems 7 / 27
12 For example, multi-shift GMRES After m steps of Arnoldi, we have, AV m = V m+1 H m, and the approximate solution yields: x m V m y m, where y m = argmin y C m H m y b e 1. For shifted systems, we get and, therefore, x (ω) m (A ωi )V m = V m+1 (H m ωi m ), V m y m (ω), where y m (ω) = argmin y C m H (ω) m y b e 1. M. Baumann () Nested Krylov methods for shifted systems 7 / 27
13 Preconditioning is a problem Main disadvantage: Preconditioners are in general not easy to apply. For it does not hold: (A ωi )P 1 ω y (ω) = b, P ω x (ω) = y (ω) K m (AP 1, b) K m (AP 1 ω ωpω 1, b). However, there are ways... Reference B. Jegerlehner, Krylov space solvers for shifted linear systems. Published online arxiv:hep-lat/ , M. Baumann () Nested Krylov methods for shifted systems 8 / 27
14 Preconditioning is a problem Main disadvantage: Preconditioners are in general not easy to apply. For it does not hold: (A ωi )P 1 ω y (ω) = b, P ω x (ω) = y (ω) K m (AP 1, b) K m (AP 1 ω ωpω 1, b). However, there are ways... Reference B. Jegerlehner, Krylov space solvers for shifted linear systems. Published online arxiv:hep-lat/ , M. Baumann () Nested Krylov methods for shifted systems 8 / 27
15 Preconditioning is a problem... or has been a problem? Short historical overview: 2002 Shift-and-invert preconditioner: P = (A τi ), τ {ω 1,..., ω N } 2007 Many shift-and-invert preconditioners: 2013 Polynomial preconditioners: P = (A τ I ) p n (A) A 1, p ω n (A) (A ωi ) Nested Krylov methods M. Baumann () Nested Krylov methods for shifted systems 9 / 27
16 Shift-and-invert preconditioner Choose P (A τi ). Then, (A ωi )P 1 ω = AP 1 η ω I = A(A τi ) 1 η ω I = [A η ω (A τi )] (A τi ) 1 [ = A + η ωτ 1 η ω I From the fit ω = ηωτ 1 η ω, we conclude ] (1 η ω )(A τi ) 1. η ω = ω ω τ, P ω = 1 P = τ ω P. 1 η ω τ M. Baumann () Nested Krylov methods for shifted systems 10 / 27
17 Polynomial preconditioners - Theory Suppose we have found, p n (A) n α i A i A 1 i=0 Question: Can we find p ω n (A) n i=0 αω i A i such that (A ωi )p ω n (A) = Ap n (A) η ω I? Reference M. I. Ahmad, D. B. Szyld, and M. B. van Gizen, Preconditioned multishift BiCG for H 2-optimal model reduction. Technical report, M. Baumann () Nested Krylov methods for shifted systems 11 / 27
18 Polynomial preconditioners - Theory Suppose we have found, p n (A) n α i A i A 1 i=0 Question: Can we find p ω n (A) n i=0 αω i A i such that (A ωi )p ω n (A) = Ap n (A) η ω I? Reference M. I. Ahmad, D. B. Szyld, and M. B. van Gizen, Preconditioned multishift BiCG for H 2-optimal model reduction. Technical report, M. Baumann () Nested Krylov methods for shifted systems 11 / 27
19 Polynomial preconditioners - Theory From (A ωi )pn ω (A) = Ap n (A) η ω I we get n n n αi ω A i+1 ωαi ω A i α i A i+1 + η ω I = 0 i=0 i=0 i=0 The latter can be solved to: α ω n = α n α ω i 1 = α i 1 + ωα ω i, for i = n,..., 1 η ω = ωα ω 0 M. Baumann () Nested Krylov methods for shifted systems 12 / 27
20 Polynomial preconditioners - In practice What goes wrong in practice? Use Chebyshev polynomials for p n (A) A 1. Based on ellipse that surrounds the spectrum of A, Does not work for indefinite matrix A. Instead, approximate the shift-and-invert preconditioner p n (A) (A τi ) 1, i.e. shift the spectrum. For Helmholtz, this resembles an approximate shifted Laplace preconditioner. M. Baumann () Nested Krylov methods for shifted systems 13 / 27
21 Polynomial preconditioners - Example (1/2) Acoustic wave propagation (Helmholtz equation): 0 Velocity profile c(x) p ( ) 2πfk p = s c(x) s = δ(x 1 300, x 2 ) depth [m] m/s 1500 m/s 3000 m/s x axis [m] We prescribe absorbing boundary conditions (Sommerfeld conditions). M. Baumann () Nested Krylov methods for shifted systems 14 / 27
22 Polynomial preconditioners - Example (2/2) We consider 5 different meshes: Grid h[m] gridpoints f k [Hz] No prec. Exact prec. PP n = / , / ,2, / ,2,4, / ,2,4,8, MS-QMRIDR(8), Seed: τ = (1 8i)2πf max Note: we have to use a shift with a large imaginary part to obtain a converging Chebyshev polynomial. [Ongoing Research] M. Baumann () Nested Krylov methods for shifted systems 15 / 27
23 Nested multi-shift Krylov methods Methodology: We have learned: Polynomial preconditioners exist Question: Can we use a Krylov polynomial? Nested multi-shift Krylov methods: Use an inner multi-shift Krylov method as preconditioner. For inner method, require collinear residuals [r (ω) = γr ]. This is the case for: multi-shift GMRES [1998] multi-shift FOM [2003] multi-shift BiCG [2003] multi-shift IDR(s) [new!] Using γ, we can preserve the shift-invariance in the outer Krylov iteration. M. Baumann () Nested Krylov methods for shifted systems 16 / 27
24 Nested multi-shift Krylov methods Methodology: We have learned: Polynomial preconditioners exist Question: Can we use a Krylov polynomial? Nested multi-shift Krylov methods: Use an inner multi-shift Krylov method as preconditioner. For inner method, require collinear residuals [r (ω) = γr ]. This is the case for: multi-shift GMRES [1998] multi-shift FOM [2003] multi-shift BiCG [2003] multi-shift IDR(s) [new!] Using γ, we can preserve the shift-invariance in the outer Krylov iteration. M. Baumann () Nested Krylov methods for shifted systems 16 / 27
25 Nested multi-shift Krylov methods Overview of one possible combination: M. Baumann () Nested Krylov methods for shifted systems 17 / 27
26 Multi-shift FOM as inner method Classical result: In FOM, the residuals are r = b Ax =... = h +1, e T y v +1. Thus, for the shifted residuals it holds: r (ω) = b (A ωi )x (ω) which gives γ = y (ω) /y. Reference =... = h (ω) +1, et y (ω) v +1, V. Simoncini, Restarted full orthogonalization method for shifted linear systems. BIT Numerical Mathematics, 43 (2003). M. Baumann () Nested Krylov methods for shifted systems 18 / 27
27 Flexible multi-shift GMRES as outer method Use flexible GMRES in the outer loop, where one column yields (A ωi ) P(ω) 1 v }{{} inner loop (A ωi ) V m = V m+1 H (ω) m, = V m+1 h (ω), 1 m. The inner loop is the truncated solution of (A ωi ) with right-hand side v using msfom. M. Baumann () Nested Krylov methods for shifted systems 19 / 27
28 Flexible multi-shift GMRES as outer method Use flexible GMRES in the outer loop, where one column yields (A ωi ) P(ω) 1 v }{{} inner loop (A ωi ) V m = V m+1 H (ω) m, = V m+1 h (ω), 1 m. The inner loop is the truncated solution of (A ωi ) with right-hand side v using msfom. M. Baumann () Nested Krylov methods for shifted systems 19 / 27
29 Flexible multi-shift GMRES The inner residuals are: Imposing r (ω) r (ω) = v (A ωi )P(ω) 1 v, r = v AP 1 v, = γr yields: (A ωi )P(ω) 1 v = γap 1 v (γ 1)v ( ) Note that the right-hand side in ( ) is a preconditioned shifted system! M. Baumann () Nested Krylov methods for shifted systems 20 / 27
30 Flexible multi-shift GMRES The inner residuals are: Imposing r (ω) r (ω) = v (A ωi )P(ω) 1 v, r = v AP 1 v, = γr yields: (A ωi )P(ω) 1 v = γap 1 v (γ 1)v ( ) Note that the right-hand side in ( ) is a preconditioned shifted system! M. Baumann () Nested Krylov methods for shifted systems 20 / 27
31 Flexible multi-shift GMRES Altogether, which yields: (A ωi )P(ω) 1 v = V m+1 h (ω) γap 1 v (γ 1)v = V m+1 h (ω) γv m+1 h V m+1 (γ 1) e = V m+1 h (ω) ( ) V m+1 γh (γ 1) e = Vm+1 h (ω) with Γ m := diag(γ 1,..., γ m ). H (ω) m = (H m I m ) Γ m + I m, M. Baumann () Nested Krylov methods for shifted systems 21 / 27
32 Flexible multi-shift GMRES Altogether, which yields: (A ωi )P(ω) 1 v = V m+1 h (ω) γap 1 v (γ 1)v = V m+1 h (ω) γv m+1 h V m+1 (γ 1) e = V m+1 h (ω) ( ) V m+1 γh (γ 1) e = Vm+1 h (ω) with Γ m := diag(γ 1,..., γ m ). H (ω) m = (H m I m ) Γ m + I m, M. Baumann () Nested Krylov methods for shifted systems 21 / 27
33 Flexible multi-shift GMRES Altogether, which yields: (A ωi )P(ω) 1 v = V m+1 h (ω) γap 1 v (γ 1)v = V m+1 h (ω) γv m+1 h V m+1 (γ 1) e = V m+1 h (ω) ( ) V m+1 γh (γ 1) e = Vm+1 h (ω) with Γ m := diag(γ 1,..., γ m ). H (ω) m = (H m I m ) Γ m + I m, M. Baumann () Nested Krylov methods for shifted systems 21 / 27
34 Flexible multi-shift GMRES Altogether, which yields: (A ωi )P(ω) 1 v = V m+1 h (ω) γap 1 v (γ 1)v = V m+1 h (ω) γv m+1 h V m+1 (γ 1) e = V m+1 h (ω) ( ) V m+1 γh (γ 1) e = Vm+1 h (ω) with Γ m := diag(γ 1,..., γ m ). H (ω) m = (H m I m ) Γ m + I m, M. Baumann () Nested Krylov methods for shifted systems 21 / 27
35 Flexible multi-shift GMRES Altogether, which yields: (A ωi )P(ω) 1 v = V m+1 h (ω) γap 1 v (γ 1)v = V m+1 h (ω) γv m+1 h V m+1 (γ 1) e = V m+1 h (ω) ( ) V m+1 γh (γ 1) e = Vm+1 h (ω) with Γ m := diag(γ 1,..., γ m ). H (ω) m = (H m I m ) Γ m + I m, M. Baumann () Nested Krylov methods for shifted systems 21 / 27
36 A first example - The setting Test case from literature: Ω = [0, 1] [0, 1] h = 0.01 implying n = grid points system size: 4n = N = 6 frequencies point source at center Reference T. Airaksinen, A. Pennanen, and J. Toivanen, A damping preconditioner for time-harmonic wave equations in fluid and elastic material. Journal of Computational Physics, M. Baumann () Nested Krylov methods for shifted systems 22 / 27
37 A first example - Convergence behavior (1/2) Preconditioned multi-shift GMRES: Relative residual norm multi shift GMRES convergence f = 5,000 f = 10,000 f = 15,000 f = 20,000 f = 25,000 f = 30,000 We observe: simultaneous solve CPU time: 17.71s # iterations M. Baumann () Nested Krylov methods for shifted systems 23 / 27
38 A first example - Convergence behavior (2/2) Preconditioned nested FOM-FGMRES: Relative residual norm Relative residual norm Inner msfom convergence f = 5,000 f = 10,000 f = 15,000 f = 20,000 f = 25,000 f = 30, # iterations Outer msgmres convergence f = 5,000 f = 10,000 f = 15,000 f = 20,000 f = 25,000 f = 30,000 We observe: 30 inner iterations truncate when inner residual norm 0.1 very few outer iterations CPU time: 9.62s # iterations M. Baumann () Nested Krylov methods for shifted systems 24 / 27
39 A first example - More nested methods We were running the same setting with different (nested) multi-shift Krylov methods: multi-shift Krylov methods msgmres rest msgmres QMRIDR(4) msidr(4) # inner iterations # outer iterations seed shift τ i i i i CPU time 17.71s 6.13s 22.35s 22.58s nested multi-shift Krylov methods FOM-FGMRES IDR(4)-FGMRES FOM-FQMRIDR(4) IDR(4)-FQMRIDR(4) # inner iterations # outer iterations seed shift τ i i i i CPU time 9.62s 32.99s 8.14s 58.36s M. Baumann () Nested Krylov methods for shifted systems 25 / 27
40 Summary Nested Krylov methods for Ax = b are widely used extension to shifted linear systems is possible Multiple combinations of inner-outer methods possible, e.g. FOM-FGMRES, IDR-FQMRIDR,... The shift-and-invert preconditioner (or the polynomial preconditioner) can be applied on top Future work: recylcing, deflation,... M. Baumann () Nested Krylov methods for shifted systems 26 / 27
41 Thank you for your attention! Further reading: M. Baumann and M. B. van Gizen. Nested Krylov methods for shifted linear systems. DIAM technical report 14-01, Further coding: M. Baumann () Nested Krylov methods for shifted systems 27 / 27
42 IDR(s) in a nutshell IDR(s) is a Krylov subspace method that enforces the residuals r n to be, G +1 r n+1 = (I µ +1 A)v n, with v n G P, where µ +1 C \ {0} and P = [p 1,..., p s ] are chosen freely. The IDR theorem states: 1 G +1 G for all 0, 2 G = {0} for some N. Reference P. Sonneveld, M. B. van Gizen, IDR(s): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations. SIAM J. Sci. Comput., M. Baumann () Nested Krylov methods for shifted systems 27 / 27
43 IDR(s) in a nutshell IDR(s) is a Krylov subspace method that enforces the residuals r n to be, G +1 r n+1 = (I µ +1 A)v n, with v n G P, where µ +1 C \ {0} and P = [p 1,..., p s ] are chosen freely. The IDR theorem states: 1 G +1 G for all 0, 2 G = {0} for some N. Reference P. Sonneveld, M. B. van Gizen, IDR(s): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations. SIAM J. Sci. Comput., M. Baumann () Nested Krylov methods for shifted systems 27 / 27
44 IDR(s) with collinear residuals Notation: Let s call  (A ωi ) and ˆr n, ˆµ +1, ˆv n,... Assuming, we have ˆv n = α n v n (not trivial!), then we want: γ n+1 r n+1 = ˆr n+1 ( ) γ n+1 (I µ +1 A) v n = I ˆµ +1  ˆv n γ n+1 (I µ +1 A) v n = (I ˆµ +1 (A ωi )) α n v n γ n+1 v n γ n+1 µ +1 Av n = (α n + α n ˆµ +1 ω)v n α n ˆµ +1 Av n Choose ˆµ +1 and γ n+1 such that the two terms match: ˆµ +1 = µ +1 1 ωµ +1, γ n+1 = α n 1 ωµ +1. M. Baumann () Nested Krylov methods for shifted systems 27 / 27
45 IDR(s) with collinear residuals Notation: Let s call  (A ωi ) and ˆr n, ˆµ +1, ˆv n,... Assuming, we have ˆv n = α n v n (not trivial!), then we want: γ n+1 r n+1 = ˆr n+1 ( ) γ n+1 (I µ +1 A) v n = I ˆµ +1  ˆv n γ n+1 (I µ +1 A) v n = (I ˆµ +1 (A ωi )) α n v n γ n+1 v n γ n+1 µ +1 Av n = (α n + α n ˆµ +1 ω)v n α n ˆµ +1 Av n Choose ˆµ +1 and γ n+1 such that the two terms match: ˆµ +1 = µ +1 1 ωµ +1, γ n+1 = α n 1 ωµ +1. M. Baumann () Nested Krylov methods for shifted systems 27 / 27
DELFT 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 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 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 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 informationInexactness and flexibility in linear Krylov solvers
Inexactness and flexibility in linear Krylov solvers Luc Giraud ENSEEIHT (N7) - IRIT, Toulouse Matrix Analysis and Applications CIRM Luminy - October 15-19, 2007 in honor of Gérard Meurant for his 60 th
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 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 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 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 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 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 informationLecture 3: Inexact inverse iteration with preconditioning
Lecture 3: Department of Mathematical Sciences CLAPDE, Durham, July 2008 Joint work with M. Freitag (Bath), and M. Robbé & M. Sadkane (Brest) 1 Introduction 2 Preconditioned GMRES for Inverse Power Method
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 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 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 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 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 informationChebyshev semi-iteration in Preconditioning
Report no. 08/14 Chebyshev semi-iteration in Preconditioning Andrew J. Wathen Oxford University Computing Laboratory Tyrone Rees Oxford University Computing Laboratory Dedicated to Victor Pereyra on his
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 informationFast iterative solvers
Utrecht, 15 november 2017 Fast iterative solvers Gerard Sleijpen Department of Mathematics http://www.staff.science.uu.nl/ sleij101/ Review. To simplify, take x 0 = 0, assume b 2 = 1. Solving Ax = b for
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 informationc 2017 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 38, No. 2, pp. 401 424 c 2017 Society for Industrial and Applied Mathematics PRECONDITIONED MULTISHIFT BiCG FOR H 2 -OPTIMAL MODEL REDUCTION MIAN ILYAS AHMAD, DANIEL B.
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 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 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 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 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 informationDepartment of Computer Science, University of Illinois at Urbana-Champaign
Department of Computer Science, University of Illinois at Urbana-Champaign Probing for Schur Complements and Preconditioning Generalized Saddle-Point Problems Eric de Sturler, sturler@cs.uiuc.edu, http://www-faculty.cs.uiuc.edu/~sturler
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 informationIDR(s) as a projection method
Delft University of Technology Faculty of Electrical Engineering, Mathematics and Computer Science Delft Institute of Applied Mathematics IDR(s) as a projection method A thesis submitted to the Delft Institute
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 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 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 informationNumerical Methods for Large-Scale Nonlinear Systems
Numerical Methods for Large-Scale Nonlinear Systems Handouts by Ronald H.W. Hoppe following the monograph P. Deuflhard Newton Methods for Nonlinear Problems Springer, Berlin-Heidelberg-New York, 2004 Num.
More informationInexact inverse iteration with preconditioning
Department of Mathematical Sciences Computational Methods with Applications Harrachov, Czech Republic 24th August 2007 (joint work with M. Robbé and M. Sadkane (Brest)) 1 Introduction 2 Preconditioned
More informationMathematics and Computer Science
Technical Report TR-2007-002 Block preconditioning for saddle point systems with indefinite (1,1) block by Michele Benzi, Jia Liu Mathematics and Computer Science EMORY UNIVERSITY International Journal
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 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 informationNumerical behavior of inexact linear solvers
Numerical behavior of inexact linear solvers Miro Rozložník joint results with Zhong-zhi Bai and Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic The fourth
More informationA short course on: Preconditioned Krylov subspace methods. Yousef Saad University of Minnesota Dept. of Computer Science and Engineering
A short course on: Preconditioned Krylov subspace methods Yousef Saad University of Minnesota Dept. of Computer Science and Engineering Universite du Littoral, Jan 19-3, 25 Outline Part 1 Introd., discretization
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 informationOn the influence of eigenvalues on Bi-CG residual norms
On the influence of eigenvalues on Bi-CG residual norms Jurjen Duintjer Tebbens Institute of Computer Science Academy of Sciences of the Czech Republic duintjertebbens@cs.cas.cz Gérard Meurant 30, rue
More informationValeria Simoncini and Daniel B. Szyld. Report October 2009
Interpreting IDR as a Petrov-Galerkin method Valeria Simoncini and Daniel B. Szyld Report 09-10-22 October 2009 This report is available in the World Wide Web at http://www.math.temple.edu/~szyld INTERPRETING
More informationLARGE SPARSE EIGENVALUE PROBLEMS
LARGE SPARSE EIGENVALUE PROBLEMS Projection methods The subspace iteration Krylov subspace methods: Arnoldi and Lanczos Golub-Kahan-Lanczos bidiagonalization 14-1 General Tools for Solving Large Eigen-Problems
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 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 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 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 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 informationTHE solution of the absolute value equation (AVE) of
The nonlinear HSS-like iterative method for absolute value equations Mu-Zheng Zhu Member, IAENG, and Ya-E Qi arxiv:1403.7013v4 [math.na] 2 Jan 2018 Abstract Salkuyeh proposed the Picard-HSS iteration method
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 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 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 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 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 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 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 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 informationKrylov Space Solvers
Seminar for Applied Mathematics ETH Zurich International Symposium on Frontiers of Computational Science Nagoya, 12/13 Dec. 2005 Sparse Matrices Large sparse linear systems of equations or large sparse
More informationA Robust Preconditioned Iterative Method for the Navier-Stokes Equations with High Reynolds Numbers
Applied and Computational Mathematics 2017; 6(4): 202-207 http://www.sciencepublishinggroup.com/j/acm doi: 10.11648/j.acm.20170604.18 ISSN: 2328-5605 (Print); ISSN: 2328-5613 (Online) A Robust Preconditioned
More informationAlternative correction equations in the Jacobi-Davidson method
Chapter 2 Alternative correction equations in the Jacobi-Davidson method Menno Genseberger and Gerard Sleijpen Abstract The correction equation in the Jacobi-Davidson method is effective in a subspace
More informationStructured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries
Structured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries Fakultät für Mathematik TU Chemnitz, Germany Peter Benner benner@mathematik.tu-chemnitz.de joint work with Heike Faßbender
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 informationSOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS. Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA
1 SOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA 2 OUTLINE Sparse matrix storage format Basic factorization
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 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 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 informationLARGE SPARSE EIGENVALUE PROBLEMS. General Tools for Solving Large Eigen-Problems
LARGE SPARSE EIGENVALUE PROBLEMS Projection methods The subspace iteration Krylov subspace methods: Arnoldi and Lanczos Golub-Kahan-Lanczos bidiagonalization General Tools for Solving Large Eigen-Problems
More informationPreconditioned GMRES Revisited
Preconditioned GMRES Revisited Roland Herzog Kirk Soodhalter UBC (visiting) RICAM Linz Preconditioning Conference 2017 Vancouver August 01, 2017 Preconditioned GMRES Revisited Vancouver 1 / 32 Table of
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 10-14 On the Convergence of GMRES with Invariant-Subspace Deflation M.C. Yeung, J.M. Tang, and C. Vuik ISSN 1389-6520 Reports of the Delft Institute of Applied Mathematics
More informationFurther experiences with GMRESR
Further experiences with GMRESR Report 92-2 C. Vui Technische Universiteit Delft Delft University of Technology Faculteit der Technische Wisunde en Informatica Faculty of Technical Mathematics and Informatics
More informationarxiv: v6 [math.na] 17 Aug 2017
arxiv:1507.08141v6 [math.na] 17 Aug 2017 Restarted Hessenberg method for solving shifted nonsymmetric linear systems Xian-Ming Gu a,b, Ting-Zhu Huang a, Guojian Yin c, Bruno Carpentieri d, Chun Wen a,
More informationGMRESR: A family of nested GMRES methods
GMRESR: A family of nested GMRES methods Report 91-80 H.A. van der Vorst C. Vui Technische Universiteit Delft Delft University of Technology Faculteit der Technische Wisunde en Informatica Faculty of Technical
More informationIndefinite and physics-based preconditioning
Indefinite and physics-based preconditioning Jed Brown VAW, ETH Zürich 2009-01-29 Newton iteration Standard form of a nonlinear system F (u) 0 Iteration Solve: Update: J(ũ)u F (ũ) ũ + ũ + u Example (p-bratu)
More informationThe quadratic eigenvalue problem (QEP) is to find scalars λ and nonzero vectors u satisfying
I.2 Quadratic Eigenvalue Problems 1 Introduction The quadratic eigenvalue problem QEP is to find scalars λ and nonzero vectors u satisfying where Qλx = 0, 1.1 Qλ = λ 2 M + λd + K, M, D and K are given
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 9 Minimizing Residual CG
More informationModel order reduction of large-scale dynamical systems with Jacobi-Davidson style eigensolvers
MAX PLANCK INSTITUTE International Conference on Communications, Computing and Control Applications March 3-5, 2011, Hammamet, Tunisia. Model order reduction of large-scale dynamical systems with Jacobi-Davidson
More informationLecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc.
Lecture 11: CMSC 878R/AMSC698R Iterative Methods An introduction Outline Direct Solution of Linear Systems Inverse, LU decomposition, Cholesky, SVD, etc. Iterative methods for linear systems Why? Matrix
More informationAlternative correction equations in the Jacobi-Davidson method. Mathematical Institute. Menno Genseberger and Gerard L. G.
Universiteit-Utrecht * Mathematical Institute Alternative correction equations in the Jacobi-Davidson method by Menno Genseberger and Gerard L. G. Sleijpen Preprint No. 173 June 1998, revised: March 1999
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 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 informationarxiv: v2 [math.na] 1 Feb 2013
A FRAMEWORK FOR DEFLATED AND AUGMENTED KRYLOV SUBSPACE METHODS ANDRÉ GAUL, MARTIN H. GUTKNECHT, JÖRG LIESEN AND REINHARD NABBEN arxiv:1206.1506v2 [math.na] 1 Feb 2013 Abstract. We consider deflation and
More informationNonlinear seismic imaging via reduced order model backprojection
Nonlinear seismic imaging via reduced order model backprojection Alexander V. Mamonov, Vladimir Druskin 2 and Mikhail Zaslavsky 2 University of Houston, 2 Schlumberger-Doll Research Center Mamonov, Druskin,
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 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 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 informationArnoldi Methods in SLEPc
Scalable Library for Eigenvalue Problem Computations SLEPc Technical Report STR-4 Available at http://slepc.upv.es Arnoldi Methods in SLEPc V. Hernández J. E. Román A. Tomás V. Vidal Last update: October,
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 10-16 An elegant IDR(s) variant that efficiently exploits bi-orthogonality properties Martin B. van Gijzen and Peter Sonneveld ISSN 1389-6520 Reports of the Department
More information19 th INTERNATIONAL CONGRESS ON ACOUSTICS MADRID, 2-7 SEPTEMBER 2007 HIGH FREQUENCY ACOUSTIC SIMULATIONS VIA FMM ACCELERATED BEM
19 th INTERNATIONAL CONGRESS ON ACOUSTICS MADRID, 2-7 SEPTEMBER 2007 HIGH FREQUENCY ACOUSTIC SIMULATIONS VIA FMM ACCELERATED BEM PACS: 43.20.Fn Gumerov, Nail A.; Duraiswami, Ramani; Fantalgo LLC, 7496
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 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 informationPreconditioned multishift BiCG for H 2 -optimal model reduction. Mian Ilyas Ahmad, Daniel B. Szyld, and Martin B. van Gijzen
Preconditioned multishift BiCG for H 2 -optimal model reduction Mian Ilyas Ahmad, Daniel B. Szyld, and Martin B. van Gijzen Report 12-06-15 Department of Mathematics Temple University June 2012. Revised
More informationIterative solvers for saddle point algebraic linear systems: tools of the trade. V. Simoncini
Iterative solvers for saddle point algebraic linear systems: tools of the trade V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The problem
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 18, pp. 49-64, 2004. Copyright 2004,. ISSN 1068-9613. ETNA EFFICIENT PRECONDITIONING FOR SEQUENCES OF PARAMETRIC COMPLEX SYMMETRIC LINEAR SYSTEMS D.
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 informationPreconditioned Conjugate Gradient-Like Methods for. Nonsymmetric Linear Systems 1. Ulrike Meier Yang 2. July 19, 1994
Preconditioned Conjugate Gradient-Like Methods for Nonsymmetric Linear Systems Ulrike Meier Yang 2 July 9, 994 This research was supported by the U.S. Department of Energy under Grant No. DE-FG2-85ER25.
More informationEfficient iterative algorithms for linear stability analysis of incompressible flows
IMA Journal of Numerical Analysis Advance Access published February 27, 215 IMA Journal of Numerical Analysis (215) Page 1 of 21 doi:1.193/imanum/drv3 Efficient iterative algorithms for linear stability
More informationFast iterative solvers
Solving Ax = b, an overview Utrecht, 15 november 2017 Fast iterative solvers A = A no Good precond. yes flex. precond. yes GCR yes A > 0 yes CG no no GMRES no ill cond. yes SYMMLQ str indef no large im
More information