Block triangular preconditioners for symmetric saddle-point problems

Applied Numerical Mathematics

Volumn 49, Issue 1, 2004, Pages 63-80

  Simoncini, V ^a,b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b CNR   (Italy)

Author keywords

Iterative methods; Preconditioning; QMR; Saddle point systems

Indexed keywords

COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; LINEAR SYSTEMS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; QUADRATIC PROGRAMMING;

PRECONDITIONING; QMR; SADDLE-POINT SYSTEMS;

ITERATIVE METHODS;

EID: 1542379947     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apnum.2003.11.012     Document Type: Conference Paper

References (32)

1. AEA Technology, Harwell Subroutine Library, Harwell Laboratory, Oxfordshire, December 1995.
2. Axelsson O. Preconditioning of indefinite problems by regularization. SIAM J. Numer. Anal. 16:1979;58-69.
3. Axelsson O., Barker V.A. Finite Element Solution of Boundary Value Problems. 1984;Academic Press, Orlando, FL.
4. O. Axelsson, M. Neytcheva, Preconditioning methods for constrained optimization problems with applications for the linear elasticity equations, Tech. Rep., Department of Mathematics, University of Nijmegen, Nijmegen, 2003.
5. Axelsson O., Neytcheva M. Preconditioning methods for linear systems arising in constrained optimization problems. Numer. Linear Algebra Appl. 10:2003;3-31.
6. D. Boffi, L. Gastaldi, Analysis of finite element approximation of evolution problems in mixed form, Tech. Rep. 1286, IAN-CNR, 2002.
7. Bramble J.H., Pasciak J.E. A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems. Math. Comp. 50:1988;1-17.
8. Brezzi F., Fortin M. Mixed and Hybrid Finite Element Methods. 1991;Springer, New York.
9. E. Chow, Y. Saad, Private communication, 1998.
10. Durazzi C., Ruggiero V. Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems. Numer. Linear Algebra Appl. 10:(8):2003;673-688.
11. Elman H. Multigrid and Krylov subspace methods for the discrete Stokes equations. Internat. J. Numer. Methods Fluids. 22:1996;755-770.
12. Elman H., Silvester D., Wathen A. Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations. Numer. Math. 90:2002;665-688.
13. Elman H.C., Silvester D.J., Wathen A.J. Finite Elements and Fast Iterative Solvers. 2003;Oxford University Press, Oxford.
14. Fischer B., Ramage A., Silvester D.J., Wathen A.J. Minimum residual methods for augmented systems. BIT. 38:1998;527-543.
15. D.R. Fokkema, Subspace Methods for Linear, Nonlinear, and Eigen Problems, Ph.D. Thesis, Utrecht University, Utrecht, 1996.
16. Freund R.W. Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations. Braess D., Schumaker L.L. Numerical Methods in Approximation Theory. vol. 9:1992;77-95 Birkhäuser, Basel.
17. Freund R.W., Nachtigal N.M. Software for simplified Lanczos and QMR algorithms. Appl. Numer. Math. 19:1995;319-341.
18. Golub G.H., Wathen A.J. An iteration for indefinite systems and its application to the Navier-Stokes equations. SIAM J. Sci. Comput. 19:1998;530-539.
19. Johnson C., Thomée V. Error estimates for some mixed finite element methods for parabolic type problems. RAIRO Anal. Numér. 15:1981;41-78.
20. Klawonn A. Block-triangular preconditioners for saddle-point problems with a penalty term. SIAM J. Sci. Comput. 19:1998;172-184.
21. Klawonn A. An optimal preconditioner for a class of saddle point problems with a penalty term. SIAM J. Sci. Comput. 19:1998;540-552.
22. Klawonn A., Starke G. Block triangular preconditioners for nonsymmetric saddle point problems: Field-of-values analysis. Numer. Math. 81:1999;577-594.
23. Krzyzanowski P. On block preconditioners for nonsymmetric saddle point problems. SIAM J. Sci. Comput. 23:2001;157-169.
24. The MathWorks, Inc., MATLAB User's Guide, Natick, MA 01760, May 2001.
25. Murphy M.F., Golub G.H., Wathen A.J. A note on preconditioning for indefinite linear systems. SIAM J. Sci. Comput. 21:2000;1969-1972.
26. Perugia I., Simoncini V. Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations. Numer. Linear Algebra Appl. 7:2000;585-616.
27. Rusten T., Winther R. A preconditioned iterative method for saddle point problems. SIAM J. Matrix Anal. Appl. 13:1992;887-904.
28. Saad Y. Iterative Methods for Sparse Linear Systems. 1996;The PWS Publishing Company, Boston, MA.
29. Saad Y., Schultz M.H. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7:1986;856-869.
30. Silvester D., Wathen A. Fast iterative solution of stabilized Stokes systems, Part II: Using general block preconditioners. SIAM J. Numer. Anal. 31:1994;1352-1367.
31. Sleijpen G.L.G., Fokkema D.R. Bicgstab(L) for linear equations involving unsymmetric matrices with complex spectrum. ETNA Electronic Trans. Numer. Anal. 1:1993;11-32.
32. Wathen A., Fischer B., Silvester D. The convergence rate of the minimal residual method for the Stokes problem. Numer. Math. 71:1995;121-134.