Preconditioning of Saddle Point Systems by Substructuring and a Penalty Approach

Lecture Notes in Computational Science and Engineering

Volumn 55, Issue , 2007, Pages 53-64

  Dohrmann, Clark R ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS;

APPROXIMATE SOLUTION; COEFFICIENT MATRIX; ORIGINAL SYSTEMS; POSITIVE DEFINITE; REGULARIZATION APPROACH; SADDLE POINT SYSTEM; SCHUR COMPLEMENT; SCHUR COMPLEMENT SYSTEM;

DOMAIN DECOMPOSITION METHODS;

EID: 84875580836     PISSN: 14397358     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-34469-8_5     Document Type: Article

References (19)

1. O. Axelsson, Preconditioning of indefinite problems by regularization, SIAM J. Numer. Anal., 16 (1979), pp. 58-69.
2. K.-J. Bathe, Finite element procedures, Prentice Hall, Englewood Cliffs, NJ, 1996.
3. J. H. Bramble and J. E. Pasciak, A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems, Mathematics of Computation, 50 (1988), pp. 1-17.
4. C. R. Dohrmann, A preconditioner for substructuring based on constrained energy minimization, SIAM J. Sci. Comput., 25 (2003), pp. 246-258.
5. C. R. Dohrmann, A substructuring preconditioner for nearly incompressible elasticity problems, Tech. Rep. SAND 2004-5393, Sandia National Laboratories, October 2004.
6. C. R. Dohrmann and R. B. Lehoucq, A primal based penalty preconditioner for elliptic saddle point systems, Tech. Rep. SAND 2004-5964, Sandia National Laboratories, 2004.
7. H. C. Elman and G. H. Golub, Inexact and preconditioned Uzawa algorithms for saddle point problems, SIAM J. Numer. Anal., (1994), pp. 1645-1661.
8. P. Goldfeld, L. F. Pavarino, and O. B. Widlund, Balancing Neumann-Neumann methods for mixed approximations of heterogeneous problems in linear elasticity, Numer. Math., 95 (2003), pp. 283-324.
9. P. Goldfield, Balancing Neumann-Neumann preconditioners for the mixed formulation of almost-incompressible linear elasticity, PhD thesis, New York University, Department of Mathematics, 2003.
10. A. Klawonn, Block-triangular preconditioners for saddle point problems with a penalty term, SIAM J. Sci. Comput., 19 (1998), pp. 172-184.
11. A. Klawonn and L. F. Pavarino, Overlapping Schwarz methods for elasticity and Stokes problems, Comput. Methods Appl. Mech. Engrg., 165 (1998), pp. 233-245.
12. J. Li, A Dual-Primal FETI method for incompressible Stokes equations, Tech. Rep. 816, Courant Institute of Mathematical Sciences, Department of Computer Sciences, 2001.
13. J. Li and O. B. Widlund, BDDC algorithms for incompressible Stokes equations, Tech. Rep. TR-861, New York University, Department of Computer Science, 2005.
14. J. Mandel and C. R. Dohrmann, Convergence of a balancing domain decomposition by constraints and energy minimization, Numer. Linear Algebra Appl., 10 (2003), pp. 639-659.
15. J. Mandel, C. R. Dohrmann, and R. Tezaur, An algebraic theory for primal and dual substructuring methods by constraints, Appl. Numer. Math., 54 (2005), pp. 167-193.
16. L. F. Pavarino and O. B. Widlund, Balancing Neumann-Neumann methods for incompressible Stokes equations, Comm. Pure Appl. Math., 55 (2002), pp. 302-335.
17. Y. Saad and M. H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comp., 7 (1986), pp. 856-869.
18. D. J. Silvester and A. J. Wathen, Fast iterative solution of stabilised Stokes systems part II: using general block preconditioners, SIAM J. Numer. Anal., 31 (1994), pp. 1352-1367.
19. B. Vereecke, H. Bavestrello, and D. Dureisseix, An extension of the FETI domain decomposition method for incompressible and nearly incompressible problems, Comput. Methods Appl. Mech. Engrg., 192 (2003), pp. 3409-3429.