Combination Preconditioning of saddle-point systems for positive definiteness
|
|
- Giles Gaines
- 6 years ago
- Views:
Transcription
1 Combination Preconditioning of saddle-point systems for positive definiteness Andy Wathen Oxford University, UK joint work with Jen Pestana Eindhoven, 2012 p.1/30
2 compute iterates with residuals Krylov subspace methods for Ax = b x k x 0 + K k (A,r 0 ) b Ax k = r k r 0 + AK k (A,r 0 ) since ie. r k = p(a)r 0, p Π k,p(0) = 1 K k (A,r 0 ) = span{r 0,Ar 0,...,A k 1 r 0 } with some optimality or orthogonality condition. Eindhoven, 2012 p.2/30
3 Given an inner product, : R n R n R Conjugate Gradients (Hestenes & Stiefel (1952)) computes iterates which minimize A(x x k ),x x k when A is self-adjoint and positive definite in, MINRES (Paige & Saunders (1975)) computes iterates for which r k,r k is minimal when A is self-adjoint in, GMRES (Saad & Schultz (1986)) computes iterates for which r k,r k is minimal for general A Eindhoven, 2012 p.3/30
4 Conjugate Gradient Method (CG) Choose x 0, compute r 0 = b Ax 0, set p 0 = r 0 for k = 0 until convergence do α k = r k,r k / Ap k,p k x k+1 = x k + α k p k r k+1 = r k α k Ap k <Test for convergence> β k = r k+1,r k+1 / r k,r k p k+1 = r k+1 + β k p k enddo computes iterates {x k } such that A(x x k ),x x k is minimal when Au,v = u,av and Au,u > 0 Eindhoven, 2012 p.4/30
5 Thus given any symmetric and positive definite matrix H if u,v = u,v H = u T Hv Choose x 0, compute r 0 = b Ax 0, set p 0 = r 0 for k = 0 until convergence do α k = r k,r k H / Ap k,p k H x k+1 = x k + α k p k r k+1 = r k α k Ap k <Test for convergence> β k = r k+1,r k+1 H / r k,r k H p k+1 = r k+1 + β k p k enddo computes iterates {x k } such that A(x x k ),x x k H = (x x k ) T A T H(x x k ) is minimal when Au,v H = u,av H and Au,u H > 0 Eindhoven, 2012 p.5/30
6 Similarly for the MINRES method: v 0 = 0,w 0 = 0,w 1 = 0, choose x 0 Compute r 0 = b Ax 0, set v 1 = r 0,γ 1 = v 1,v 1 H Set η = γ 1,s 0 = s 1 = 0,c 0 = c 1 = 1 for j = 1 until convergence do v j = v j /γ j δ j = v j,av j H v j+1 = Av j δ j v j γ j v j 1 γ j+1 = v j+1,v j+1 H α 0 = c j δ j c j 1 s j γ j,α 1 = α γ2 j+1 α 2 = s j δ j + c j 1 c j γ j,α 3 = s j 1 γ j c j+1 = α 0 /α 1 ; s j+1 = γ j+1 /α 1 w j+1 = (v j+1 α 3 w j 1 α 2 w j )/α 1 x j = x j 1 + c j+1 ηw j+1 η = s j+1 η, then <Test for convergence> enddo minimises r k,r k H when Ax,y H = x,ay H Eindhoven, 2012 p.6/30
7 Self-adjointness: assume, : R n R n R is a symmetric bilinear form or an inner product A R n n is self-adjoint in, iff Ax,y = x,ay Self-adjointness of A in, H thus means for all x,y ( x,y H = x T Hy) x T A T Hy = Ax,y H = x,ay H = x T HAy for all x,y A T H = HA is the relation for self-adjointness of A in, H Eindhoven, 2012 p.7/30
8 Preconditioning For example left preconditioning: Âx = P 1 Ax = P 1 b = b induces a self-adjoint matrix in, H iff A T P T H = HP 1 A Eindhoven, 2012 p.8/30
9 An important example The Bramble-Pasciak CG for saddle point problems: A B T A0 0 A = with preconditioner P = B C B I The (left) preconditioned matrix  = P 1 A = A 1 0 A A 1 0 BT BA 1 0 A B BA 1 0 BT + C is not symmetric but is self-adjoint and positive definite when A A0 0 H = 0 I defines an inner product x,y H := x T Hy CG can be used in this inner product Eindhoven, 2012 p.9/30
10 Basic properties: If A 1 and A 2 are self-adjoint in, H then for LEMMA any α,β R, αa 1 + βa 2 is self-adjoint in, H Eindhoven, 2012 p.10/30
11 Basic properties: If A 1 and A 2 are self-adjoint in, H then for LEMMA any α,β R, αa 1 + βa 2 is self-adjoint in, H LEMMA If A is self-adjoint in, H1 and in, H2 then A is self-adjoint in, αh1 +βh 2 for every α,β R Eindhoven, 2012 p.10/30
12 Basic properties: If A 1 and A 2 are self-adjoint in, H then for LEMMA any α,β R, αa 1 + βa 2 is self-adjoint in, H LEMMA If A is self-adjoint in, H1 and in, H2 then A is self-adjoint in, αh1 +βh 2 for every α,β R and of relevance when preconditioning: For symmetric A, Â = P 1 A is self-adjoint in LEMMA, H if and only if P T H is self-adjoint in, A Eindhoven, 2012 p.10/30
13 Basic properties: If A 1 and A 2 are self-adjoint in, H then for LEMMA any α,β R, αa 1 + βa 2 is self-adjoint in, H LEMMA If A is self-adjoint in, H1 and in, H2 then A is self-adjoint in, αh1 +βh 2 for every α,β R and of relevance when preconditioning: For symmetric A, Â = P 1 A is self-adjoint in LEMMA, H if and only if P T H is self-adjoint in, A PROOF (P T H) T A = HP 1 A = (P 1 A) T H = A(P T H) Eindhoven, 2012 p.10/30
14 also combining the above: LEMMA If P 1 and P 2 are left preconditioners for the symmetric matrix A for which symmetric matrices H 1 and H 2 exist with P 1 1 A self-adjoint in, H 1 and P 1 2 A self-adjoint in, H2 and if for any α,β αp T 1 H 1 + βp T 2 H 2 = P T 3 H 3 for some matrix P 3 and some symmetric matrix H 3 then P 1 3 A is self-adjoint in, H 3. shows: if we have two instances of this structure and can find such a splitting we have found a new preconditioner and a bilinear form in which the matrix is self-adjoint. Eindhoven, 2012 p.11/30
15 also combining the above: LEMMA If P 1 and P 2 are left preconditioners for the symmetric matrix A for which symmetric matrices H 1 and H 2 exist with P 1 1 A self-adjoint in, H 1 and P 1 2 A self-adjoint in, H2 and if for any α,β αp T 1 H 1 + βp T 2 H 2 = P T 3 H 3 for some matrix P 3 and some symmetric matrix H 3 then P 1 3 A is self-adjoint in, H 3. shows: if we have two instances of this structure and can find such a splitting we have found a new preconditioner and a bilinear form in which the matrix is self-adjoint. Combination Preconditioners Eindhoven, 2012 p.11/30
16 Intriguing possibilities: if H 1,H 2,H 3 are all positive definite (so define inner products) but P 1 1 A,P 1 2 A are indefinite, can P 1 3 A be positive definite? Eindhoven, 2012 p.12/30
17 Intriguing possibilities: if H 1,H 2,H 3 are all positive definite (so define inner products) but P 1 1 A,P 1 2 A are indefinite, can P 1 3 A be positive definite? can H 1 and H 2 be indefinite but H 3 be positive definite? Eindhoven, 2012 p.12/30
18 Intriguing possibilities: if H 1,H 2,H 3 are all positive definite (so define inner products) but P 1 1 A,P 1 2 A are indefinite, can P 1 3 A be positive definite? can H 1 and H 2 be indefinite but H 3 be positive definite? Answers: YES and YES Eindhoven, 2012 p.12/30
19 Saddle Point examples Bramble-Pasciak CG (Bramble & Pasciak (1988)) widely used CG technique with preconditioner P 1 A 1 = 0 0 BA 1 0 I and inner product matrix H = A A0 0 0 I Eindhoven, 2012 p.13/30
20 Saddle Point examples Bramble-Pasciak CG (Bramble & Pasciak (1988)) widely used CG technique with preconditioner P 1 A 1 = 0 0 BA 1 0 I and inner product matrix H = A A0 0 0 I main drawback: requires A 0 < A but P 1 A is always positive definite when this is true Eindhoven, 2012 p.13/30
21 Examples: BP with Schur complement preconditioner (Klawonn (1998), Meyer et al. (2001), Simoncini (2001)) Inner product: P 1 = H = A S 1 0 BA 1 0 S 1 0 A A0 0 0 S 0 similar conditions as BP for positive definiteness Eindhoven, 2012 p.14/30
22 Examples: Zulehner (Zulehner (2001), Schöberl & Zulehner (2007)) P = A0 B T B BA 1 0 BT S 0 = I 0 BA 1 0 I A0 B T 0 S 0 gives P 1 A self-adjoint in, H, A0 A 0 H = 0 BA 1 0 BT S 0 So H defines an inner product if A 0 > A and S 0 < BA 1 0 BT Whenever H is positive definite, then P 1 A is positive definite in, H. Eindhoven, 2012 p.15/30
23 Examples: Benzi-Simoncini (Benzi and Simoncini (2006)) extension of CG method of Fischer, Ramage, Silvester & W (1998) P 1 I 0 = 0 I inner product: H = A γi B T B γi Extension for C 0 (Liesen (2006), Liesen & Parlett (2007)): A γi B T H = B γi C Eindhoven, 2012 p.16/30
24 Example: Bramble-Pasciak + method (BP + )(Stoll & W(2008)) P 1 A 1 = 0 0 BA 1 0 I and inner product H = A + A0 0 0 I Note: H defines an inner product for any symmetric and positive definite preconditioner A 0 can always apply MINRES in this inner product Eindhoven, 2012 p.17/30
25 Example: Bramble-Pasciak + method (BP + )(Stoll & W(2008)) P 1 A 1 = 0 0 BA 1 0 I and inner product H = A + A0 0 0 I Note: H defines an inner product for any symmetric and positive definite preconditioner A 0 can always apply MINRES in this inner product But preconditioned matrix always indefinite in this inner product Eindhoven, 2012 p.17/30
26 Similarly there exists a Schöberl-Zulehner + method (SZ + ) (Pestana & W(2012)) A0 B T P = B BA 1 0 BT + S 0 = I 0 BA 1 0 I A0 0 0 S 0 I A 1 0 BT 0 I gives P 1 A self-adjoint in, H, A0 + A 0 H = 0 BA 1 0 BT + S 0 So H always defines an inner product, but P 1 A is always indefinite in this inner product. Eindhoven, 2012 p.18/30
27 final example: Block Diagonal Preconditioner (BD) (Silvester& W (1993), Murphy, Golub & W (2000), Korzak (1999), Kuznetsov (1995)) A0 0 P = H = 0 S 0 for which is clearly symmetric. HP 1 A = A = A B T B C But A indefinite P 1 A is always indefinite in, H Eindhoven, 2012 p.19/30
28 Many of the above are special cases of the Krzyzanowski preconditioner (Krzyzanowski (2011)) P = I 0 cba 1 0 I A0 0 I da 1 0 BT 0 S 0 0 I for which P 1 A is self-adjoint in, H with A0 ca 0 H = ǫ 0 S 0 + cdba 1 0 BT + dc,ǫ = ±1 General (but not simple in general) formulae for eigenvalues of P 1 A are available (Pestana & W (2012)) Eindhoven, 2012 p.20/30
29 Combination preconditioning Final lemma above shows that if can find P 3 and H 3 with αp T 1 H 1 + βp T 2 H 2 = P T 3 H 3 this gives a new preconditioner P 3 and the symmetric bilinear form, H3 in which P 1 3 A is self-adjoint Eindhoven, 2012 p.21/30
30 Combine Bramble-Pasciak and Benzi-Simoncini: αp 1 1 H 1 + βp 1 2 H 2 = (αa βi)a (α + βγ)i (αa βi)b T βb (α + βγ)i One possibility for αp T 1 H 1 + βp T 2 H 2 = P T P T 3 = αa βi 0 0 βi 3 H 3 is and H 3 = A (α + βγ)(αa βi) 1 B T B α+βγ β I Eindhoven, 2012 p.22/30
31 Combine BP and BP + αp T 1 H 1 + (1 α)p T 2 H 2 = A 1 0 A + (1 2α)I A 1 0 BT 0 (1 2α)I Eindhoven, 2012 p.23/30
32 Combine BP and BP + αp T 1 H 1 + (1 α)p T 2 H 2 = A 1 0 A + (1 2α)I A 1 0 BT 0 (1 2α)I can be split as P T A 1 3 = 0 A 1 0 BT 0 (1 2α)I,H 3 = A + (1 2α)A0 0 0 I Eindhoven, 2012 p.23/30
33 Combine BP and BP + αp T 1 H 1 + (1 α)p T 2 H 2 = A 1 0 A + (1 2α)I A 1 0 BT 0 (1 2α)I can be split as P T A 1 3 = 0 A 1 0 BT 0 (1 2α)I,H 3 = A + (1 2α)A0 0 0 I Recall P 1 3 A is self-adjoint in, H 3 Eindhoven, 2012 p.23/30
34 Combine BP and BP + αp T 1 H 1 + (1 α)p T 2 H 2 = A 1 0 A + (1 2α)I A 1 0 BT 0 (1 2α)I can be split as P T A 1 3 = 0 A 1 0 BT 0 (1 2α)I,H 3 = A + (1 2α)A0 0 0 I Recall P 1 3 A is self-adjoint in, H 3 (α = 1 BP, α = 0 BP + ) Eindhoven, 2012 p.23/30
35 Combine BP + and SZ + P 3 = H 3 = I 0 BA 1 0 I 1 α+β A 0 β α+β BT 0 S 0 A + A0 0 0 (α + β)s 0 + βba 1 0 BT Clearly H 3 positive definite at least for some α,β but P 1 3 A always indefinite when, H 3 defines an inner product. Eindhoven, 2012 p.24/30
36 Combine BP + and BD P 3 = H 3 = A 0 0 α α+β B 1 α+β S 0 α(a + A0 ) + βa S 0, Theorem: if α > 0 and α + β < 0 then H 3 is positive definite and so, H3 defines an inner product with respect to which P 1 3 A is positive definite if and only if A 0 > α α + β A Eindhoven, 2012 p.25/30
37 CG iteration counts for the 4 standard ifiss Stokes test problems: Taylor-Hood elements (C = 0), A 0 : no-fill ichol, S 0 : mass matrix Problem h BP + BD Comb (α,β) % reduction Channel flow Backward step Regularized cavity Colliding flow (1.3,-2) (1.7,-2) (0.7,-0.6) (1.4,-2) (1.4,-1.6) (1.2,-1) (1.1,-1.8) (1.2,-1.5) (1.9,-2) (1.1,-1.8) (0.8,-1) (1.4,-1.5) 21 Eindhoven, 2012 p.26/30
38 Relative preconditioned residual BDI BP+ BDW Comb MR Comb CG Iteration Eindhoven, 2012 p.27/30
39 CG iteration counts for the 4 standard ifiss Stokes test problems: Taylor-Hood elements (C = 0), A 0 : 1 AMG V-cycle, S 0 : mass matrix Problem h BP + BD Comb (α,β) % reduction Channel flow Backward step Cavity flow Colliding flow (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) (1.1,-2) 36 Eindhoven, 2012 p.28/30
40 Summary iterative methods more reliable/descriptive convergence theory/know what preconditioning is trying to achieve when matrix is symmetric or self-adjoint Eindhoven, 2012 p.29/30
41 Summary iterative methods more reliable/descriptive convergence theory/know what preconditioning is trying to achieve when matrix is symmetric or self-adjoint for saddle-point problems, examples of self-adjointness in non-standard inner products exist and can be combined to give further examples by interpolation between such examples Eindhoven, 2012 p.29/30
42 Summary iterative methods more reliable/descriptive convergence theory/know what preconditioning is trying to achieve when matrix is symmetric or self-adjoint for saddle-point problems, examples of self-adjointness in non-standard inner products exist and can be combined to give further examples by interpolation between such examples two indefinite examples can be combined to give a positive definite preconditioned matrix (and so allow CG in the associated inner product) Eindhoven, 2012 p.29/30
43 Summary iterative methods more reliable/descriptive convergence theory/know what preconditioning is trying to achieve when matrix is symmetric or self-adjoint for saddle-point problems, examples of self-adjointness in non-standard inner products exist and can be combined to give further examples by interpolation between such examples two indefinite examples can be combined to give a positive definite preconditioned matrix (and so allow CG in the associated inner product) application here to saddle-point matrices, but theory is more general Eindhoven, 2012 p.29/30
44 Acknowledgement This work is partially supported by Award No. KUK-C made by King Abdullah University of Science and Technology (KAUST) Eindhoven, 2012 p.30/30
Chebyshev 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 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 informationBlock-triangular preconditioners for PDE-constrained optimization
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. () Published online in Wiley InterScience (www.interscience.wiley.com). DOI:./nla.693 Block-triangular preconditioners for PDE-constrained
More informationOn the accuracy of saddle point solvers
On the accuracy of saddle point solvers Miro Rozložník joint results with Valeria Simoncini and Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic Seminar at
More informationON THE ROLE OF COMMUTATOR ARGUMENTS IN THE DEVELOPMENT OF PARAMETER-ROBUST PRECONDITIONERS FOR STOKES CONTROL PROBLEMS
ON THE ROLE OF COUTATOR ARGUENTS IN THE DEVELOPENT OF PARAETER-ROBUST PRECONDITIONERS FOR STOKES CONTROL PROBLES JOHN W. PEARSON Abstract. The development of preconditioners for PDE-constrained optimization
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 41, pp. 13-20, 2014. Copyright 2014,. ISSN 1068-9613. A NOTE ON PRECONDITIONERS AND SCALAR PRODUCTS IN KRYLOV SUBSPACE METHODS FOR SELF-ADJOINT PROBLEMS
More informationFast solvers for steady incompressible flow
ICFD 25 p.1/21 Fast solvers for steady incompressible flow Andy Wathen Oxford University wathen@comlab.ox.ac.uk http://web.comlab.ox.ac.uk/~wathen/ Joint work with: Howard Elman (University of Maryland,
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 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 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 informationStructured Preconditioners for Saddle Point Problems
Structured Preconditioners for Saddle Point Problems V. Simoncini Dipartimento di Matematica Università di Bologna valeria@dm.unibo.it p. 1 Collaborators on this project Mario Arioli, RAL, UK Michele Benzi,
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 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 informationOn the Superlinear Convergence of MINRES. Valeria Simoncini and Daniel B. Szyld. Report January 2012
On the Superlinear Convergence of MINRES Valeria Simoncini and Daniel B. Szyld Report 12-01-11 January 2012 This report is available in the World Wide Web at http://www.math.temple.edu/~szyld 0 Chapter
More informationThe antitriangular factorisation of saddle point matrices
The antitriangular factorisation of saddle point matrices J. Pestana and A. J. Wathen August 29, 2013 Abstract Mastronardi and Van Dooren [this journal, 34 (2013) pp. 173 196] recently introduced the block
More informationIndefinite Preconditioners for PDE-constrained optimization problems. V. Simoncini
Indefinite Preconditioners for PDE-constrained optimization problems V. Simoncini Dipartimento di Matematica, Università di Bologna, Italy valeria.simoncini@unibo.it Partly joint work with Debora Sesana,
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 informationLinear and Non-Linear Preconditioning
and Non- martin.gander@unige.ch University of Geneva July 2015 Joint work with Victorita Dolean, Walid Kheriji, Felix Kwok and Roland Masson (1845): First Idea of After preconditioning, it takes only three
More informationEfficient Solvers for the Navier Stokes Equations in Rotation Form
Efficient Solvers for the Navier Stokes Equations in Rotation Form Computer Research Institute Seminar Purdue University March 4, 2005 Michele Benzi Emory University Atlanta, GA Thanks to: NSF (MPS/Computational
More informationThe Mixed Finite Element Multigrid Preconditioned Minimum Residual Method for Stokes Equations
The Mixed Finite Element Multigrid Preconditioned Minimum Residual Method for Stokes Equations K. Muzhinji, S. Shateyi, and S, S. Motsa 2 University of Venda, Department of Mathematics, P Bag X5050, Thohoyandou
More informationPRECONDITIONING ITERATIVE METHODS FOR THE OPTIMAL CONTROL OF THE STOKES EQUATIONS
PRECONDITIONING ITERATIVE METHODS FOR THE OPTIMAL CONTROL OF THE STOKES EQUATIONS TYRONE REES, ANDREW J. WATHEN Abstract. Solving problems regarding the optimal control of partial differential equations
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 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 informationITERATIVE METHODS BASED ON KRYLOV SUBSPACES
ITERATIVE METHODS BASED ON KRYLOV SUBSPACES LONG CHEN We shall present iterative methods for solving linear algebraic equation Au = b based on Krylov subspaces We derive conjugate gradient (CG) method
More informationStructured Preconditioners for Saddle Point Problems
Structured Preconditioners for Saddle Point Problems V. Simoncini Dipartimento di Matematica Università di Bologna valeria@dm.unibo.it. p.1/16 Collaborators on this project Mario Arioli, RAL, UK Michele
More informationAn advanced ILU preconditioner for the incompressible Navier-Stokes equations
An advanced ILU preconditioner for the incompressible Navier-Stokes equations M. ur Rehman C. Vuik A. Segal Delft Institute of Applied Mathematics, TU delft The Netherlands Computational Methods with Applications,
More informationThe Mixed Finite Element Multigrid Preconditioned MINRES Method for Stokes Equations
Journal of Applied Fluid Mechanics, Vol. 9, No. 3, pp. 285-296, 206. Available online at www.jafmonline.net, ISSN 735-3572, EISSN 735-3645. DOI: 0.8869/acadpub.jafm.68.228.22805 The Mixed Finite Element
More informationKey words. inf-sup constant, iterative solvers, preconditioning, saddle point problems
NATURAL PRECONDITIONING AND ITERATIVE METHODS FOR SADDLE POINT SYSTEMS JENNIFER PESTANA AND ANDREW J. WATHEN Abstract. The solution of quadratic or locally quadratic extremum problems subject to linear(ized)
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 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 informationSolutions and Notes to Selected Problems In: Numerical Optimzation by Jorge Nocedal and Stephen J. Wright.
Solutions and Notes to Selected Problems In: Numerical Optimzation by Jorge Nocedal and Stephen J. Wright. John L. Weatherwax July 7, 2010 wax@alum.mit.edu 1 Chapter 5 (Conjugate Gradient Methods) Notes
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 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 information1 Conjugate gradients
Notes for 2016-11-18 1 Conjugate gradients We now turn to the method of conjugate gradients (CG), perhaps the best known of the Krylov subspace solvers. The CG iteration can be characterized as the iteration
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 2018/19 Part 4: Iterative Methods PD
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 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 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 informationPreconditioners for state constrained optimal control problems with Moreau-Yosida penalty function
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2011; 00:1 15 Published online in Wiley InterScience (www.interscience.wiley.com). Preconditioners for state constrained optimal control
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 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 informationPreconditioners for reduced saddle point systems arising in elliptic PDE-constrained optimization problems
Zeng et al. Journal of Inequalities and Applications 205 205:355 DOI 0.86/s3660-05-0879-x RESEARCH Open Access Preconditioners for reduced saddle point systems arising in elliptic PDE-constrained optimization
More informationEfficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization
Efficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization Timo Heister, Texas A&M University 2013-02-28 SIAM CSE 2 Setting Stationary, incompressible flow problems
More informationANALYSIS OF ITERATIVE METHODS FOR SADDLE POINT PROBLEMS: A UNIFIED APPROACH
MATHEMATICS OF COMPUTATION Volume 71, Number 38, Pages 79 505 S 005-571801)013- Article electronically published on May 1, 001 ANALYSIS OF ITERATIVE METHODS FOR SADDLE POINT PROBLEMS: A UNIFIED APPROACH
More informationA stable variant of Simpler GMRES and GCR
A stable variant of Simpler GMRES and GCR Miroslav Rozložník joint work with Pavel Jiránek and Martin H. Gutknecht Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic miro@cs.cas.cz,
More informationSome Preconditioning Techniques for Saddle Point Problems
Some Preconditioning Techniques for Saddle Point Problems Michele Benzi 1 and Andrew J. Wathen 2 1 Department of Mathematics and Computer Science, Emory University, Atlanta, Georgia 30322, USA. benzi@mathcs.emory.edu
More informationNotes on Some Methods for Solving Linear Systems
Notes on Some Methods for Solving Linear Systems Dianne P. O Leary, 1983 and 1999 and 2007 September 25, 2007 When the matrix A is symmetric and positive definite, we have a whole new class of algorithms
More informationGeneralized MINRES or Generalized LSQR?
Generalized MINRES or Generalized LSQR? Michael Saunders Systems Optimization Laboratory (SOL) Institute for Computational Mathematics and Engineering (ICME) Stanford University New Frontiers in Numerical
More informationEECS 275 Matrix Computation
EECS 275 Matrix Computation Ming-Hsuan Yang Electrical Engineering and Computer Science University of California at Merced Merced, CA 95344 http://faculty.ucmerced.edu/mhyang Lecture 20 1 / 20 Overview
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 informationConjugate Gradient algorithm. Storage: fixed, independent of number of steps.
Conjugate Gradient algorithm Need: A symmetric positive definite; Cost: 1 matrix-vector product per step; Storage: fixed, independent of number of steps. The CG method minimizes the A norm of the error,
More informationON THE DEVELOPMENT OF PARAMETER-ROBUST PRECONDITIONERS AND COMMUTATOR ARGUMENTS FOR SOLVING STOKES CONTROL PROBLEMS
Electronic Transactions on Numerical Analysis. Volume 44,. 53 72, 25. Coyright c 25,. ISSN 68 963. ETNA ON THE DEVELOPMENT OF PARAMETER-ROBUST PRECONDITIONERS AND COMMUTATOR ARGUMENTS FOR SOLVING STOKES
More informationarxiv: v1 [math.na] 18 Dec 2017
A Bramble-Pasciak conjugate gradient method for discrete Stokes problems with lognormal random viscosity arxiv:1712.06472v1 [math.na] 18 Dec 2017 Christopher Müller 1,2, Sebastian Ullmann 1,2, and Jens
More informationContribution of Wo¹niakowski, Strako²,... The conjugate gradient method in nite precision computa
Contribution of Wo¹niakowski, Strako²,... The conjugate gradient method in nite precision computations ªaw University of Technology Institute of Mathematics and Computer Science Warsaw, October 7, 2006
More informationRESIDUAL SMOOTHING AND PEAK/PLATEAU BEHAVIOR IN KRYLOV SUBSPACE METHODS
RESIDUAL SMOOTHING AND PEAK/PLATEAU BEHAVIOR IN KRYLOV SUBSPACE METHODS HOMER F. WALKER Abstract. Recent results on residual smoothing are reviewed, and it is observed that certain of these are equivalent
More informationBlock triangular preconditioner for static Maxwell equations*
Volume 3, N. 3, pp. 589 61, 11 Copyright 11 SBMAC ISSN 11-85 www.scielo.br/cam Block triangular preconditioner for static Maxwell equations* SHI-LIANG WU 1, TING-ZHU HUANG and LIANG LI 1 School of Mathematics
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 informationJournal of Computational and Applied Mathematics. Optimization of the parameterized Uzawa preconditioners for saddle point matrices
Journal of Computational Applied Mathematics 6 (009) 136 154 Contents lists available at ScienceDirect Journal of Computational Applied Mathematics journal homepage: wwwelseviercom/locate/cam Optimization
More informationLinear Solvers. Andrew Hazel
Linear Solvers Andrew Hazel Introduction Thus far we have talked about the formulation and discretisation of physical problems...... and stopped when we got to a discrete linear system of equations. Introduction
More informationPreconditioning of Saddle Point Systems by Substructuring and a Penalty Approach
Preconditioning of Saddle Point Systems by Substructuring and a Penalty Approach Clark R. Dohrmann 1 Sandia National Laboratories, crdohrm@sandia.gov. Sandia is a multiprogram laboratory operated by Sandia
More informationThe Conjugate Gradient Method
The Conjugate Gradient Method The minimization problem We are given a symmetric positive definite matrix R n n and a right hand side vector b R n We want to solve the linear system Find u R n such that
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 information7.4 The Saddle Point Stokes Problem
346 CHAPTER 7. APPLIED FOURIER ANALYSIS 7.4 The Saddle Point Stokes Problem So far the matrix C has been diagonal no trouble to invert. This section jumps to a fluid flow problem that is still linear (simpler
More information1. Introduction. We consider the solution of systems of linear equations with the following block 2 2 structure:
SIAM J. MATRIX ANAL. APPL. Vol. 26, No. 1, pp. 20 41 c 2004 Society for Industrial and Applied Mathematics A PRECONDITIONER FOR GENERALIZED SADDLE POINT PROBLEMS MICHELE BENZI AND GENE H. GOLUB Abstract.
More informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.4: Krylov Subspace Methods 2 / 51 Krylov Subspace Methods In this chapter we give
More informationRecent computational developments in Krylov Subspace Methods for linear systems. Valeria Simoncini and Daniel B. Szyld
Recent computational developments in Krylov Subspace Methods for linear systems Valeria Simoncini and Daniel B. Szyld A later version appeared in : Numerical Linear Algebra w/appl., 2007, v. 14(1), pp.1-59.
More informationLinear and Non-Linear Preconditioning
and Non- martin.gander@unige.ch University of Geneva June 2015 Invents an Iterative Method in a Letter (1823), in a letter to Gerling: in order to compute a least squares solution based on angle measurements
More informationIterative solution of saddle point problems
Iterative solution of saddle point problems Miroslav Rozložník, Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague and Faculty of Mechatronics and Interdisciplinary Engineering
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationPreconditioning Techniques Analysis for CG Method
Preconditioning Techniques Analysis for CG Method Huaguang Song Department of Computer Science University of California, Davis hso@ucdavis.edu Abstract Matrix computation issue for solve linear system
More informationAlex Townsend Cornell University
Continuous analogues of Krylov methods for differential operators Alex Townsend Cornell University townsend@cornell.edu Joint work with: Marc Aurèle Gilles Based on Continuous analogues of Krylov methods
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 informationKey words. conjugate gradients, normwise backward error, incremental norm estimation.
Proceedings of ALGORITMY 2016 pp. 323 332 ON ERROR ESTIMATION IN THE CONJUGATE GRADIENT METHOD: NORMWISE BACKWARD ERROR PETR TICHÝ Abstract. Using an idea of Duff and Vömel [BIT, 42 (2002), pp. 300 322
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 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 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 informationPrince Chidyagwai, Scott Ladenheim, and Daniel B. Szyld. Report July 2015, Revised October 2015
CONSTRAINT PRECONDITIONING FOR THE COUPLED STOKES-DARCY SYSTEM Prince Chidyagwai, Scott Ladenheim, and Daniel B. Szyld Report 5-07-9 July 05, Revised October 05 This is a report of the Department of Mathematics
More informationON A GENERAL CLASS OF PRECONDITIONERS FOR NONSYMMETRIC GENERALIZED SADDLE POINT PROBLEMS
U..B. Sci. Bull., Series A, Vol. 78, Iss. 4, 06 ISSN 3-707 ON A GENERAL CLASS OF RECONDIIONERS FOR NONSYMMERIC GENERALIZED SADDLE OIN ROBLE Fatemeh anjeh Ali BEIK his paper deals with applying a class
More informationIN this paper, we investigate spectral properties of block
On the Eigenvalues Distribution of Preconditioned Block wo-by-two Matrix Mu-Zheng Zhu and a-e Qi Abstract he spectral properties of a class of block matrix are studied, which arise in the numercial solutions
More informationPeter Deuhard. for Symmetric Indenite Linear Systems
Peter Deuhard A Study of Lanczos{Type Iterations for Symmetric Indenite Linear Systems Preprint SC 93{6 (March 993) Contents 0. Introduction. Basic Recursive Structure 2. Algorithm Design Principles 7
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 informationNatural preconditioners for saddle point systems
Natural preconditioners for saddle point systems Jennifer Pestana and Andrew J. Wathen August 29, 2013 Abstract The solution of quadratic or locally quadratic extremum problems subject to linear(ized)
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 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 informationResearch Article Residual Iterative Method for Solving Absolute Value Equations
Abstract and Applied Analysis Volume 2012, Article ID 406232, 9 pages doi:10.1155/2012/406232 Research Article Residual Iterative Method for Solving Absolute Value Equations Muhammad Aslam Noor, 1 Javed
More informationBlock preconditioners for saddle point systems arising from liquid crystal directors modeling
Noname manuscript No. (will be inserted by the editor) Block preconditioners for saddle point systems arising from liquid crystal directors modeling Fatemeh Panjeh Ali Beik Michele Benzi Received: date
More informationINCOMPLETE FACTORIZATION CONSTRAINT PRECONDITIONERS FOR SADDLE-POINT MATRICES
INCOMPLEE FACORIZAION CONSRAIN PRECONDIIONERS FOR SADDLE-POIN MARICES H. S. DOLLAR AND A. J. WAHEN Abstract. We consider the application of the conjugate gradient method to the solution of large symmetric,
More informationPrince Chidyagwai, Scott Ladenheim, and Daniel B. Szyld. Report July 2015
CONSTRAINT PRECONDITIONING FOR THE COUPLED STOKES-DARCY SYSTEM Prince Chidyagwai, Scott Ladenheim, and Daniel B. Szyld Report 5-07-9 July 05 This is a report of the Department of Mathematics at Temple
More informationContents. Preface... xi. Introduction...
Contents Preface... xi Introduction... xv Chapter 1. Computer Architectures... 1 1.1. Different types of parallelism... 1 1.1.1. Overlap, concurrency and parallelism... 1 1.1.2. Temporal and spatial parallelism
More informationPostprint.
http://www.diva-portal.org Postprint This is the accepted version of a paper published in Journal of Computational and Applied Mathematics. This paper has been peer-reviewed but does not include the final
More informationSparse matrix methods in quantum chemistry Post-doctorale cursus quantumchemie Han-sur-Lesse, Belgium
Sparse matrix methods in quantum chemistry Post-doctorale cursus quantumchemie Han-sur-Lesse, Belgium Dr. ir. Gerrit C. Groenenboom 14 june - 18 june, 1993 Last revised: May 11, 2005 Contents 1 Introduction
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 informationRegularized HSS iteration methods for saddle-point linear systems
BIT Numer Math DOI 10.1007/s10543-016-0636-7 Regularized HSS iteration methods for saddle-point linear systems Zhong-Zhi Bai 1 Michele Benzi 2 Received: 29 January 2016 / Accepted: 20 October 2016 Springer
More informationON THE GENERALIZED DETERIORATED POSITIVE SEMI-DEFINITE AND SKEW-HERMITIAN SPLITTING PRECONDITIONER *
Journal of Computational Mathematics Vol.xx, No.x, 2x, 6. http://www.global-sci.org/jcm doi:?? ON THE GENERALIZED DETERIORATED POSITIVE SEMI-DEFINITE AND SKEW-HERMITIAN SPLITTING PRECONDITIONER * Davod
More informationON A SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS
J. Appl. Math. & Informatics Vol. 36(208, No. 5-6, pp. 459-474 https://doi.org/0.437/jami.208.459 ON A SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS DAVOD KHOJASTEH SALKUYEH, MARYAM ABDOLMALEKI, SAEED
More informationc 2004 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 6, No., pp. 377 389 c 004 Society for Industrial and Applied Mathematics SPECTRAL PROPERTIES OF THE HERMITIAN AND SKEW-HERMITIAN SPLITTING PRECONDITIONER FOR SADDLE POINT
More informationReduced Synchronization Overhead on. December 3, Abstract. The standard formulation of the conjugate gradient algorithm involves
Lapack Working Note 56 Conjugate Gradient Algorithms with Reduced Synchronization Overhead on Distributed Memory Multiprocessors E. F. D'Azevedo y, V.L. Eijkhout z, C. H. Romine y December 3, 1999 Abstract
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 informationSome minimization problems
Week 13: Wednesday, Nov 14 Some minimization problems Last time, we sketched the following two-step strategy for approximating the solution to linear systems via Krylov subspaces: 1. Build a sequence of
More information