On solving block-structured indefinite linear systems

SIAM Journal on Scientific Computing

Volumn 24, Issue 6, 2003, Pages 2076-2092

  Golub, Gene H ^a   Greif, Chen ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Augmented lagrangian; Condition number; Indefinite linear systems; Schur complement; Singularity; Spectrum

Indexed keywords

INVERSE PROBLEMS; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; OPTIMIZATION; POLES AND ZEROS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

AUGMENTED LAGRANGIAN; CONDITION NUMBER; INDEFINITE LINEAR SYSTEMS; SCHUR COMPLEMENT;

LINEAR SYSTEMS;

EID: 0347577906     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827500375096     Document Type: Article

References (50)

1. M. Arioli and L. Baldini, A backward error analysis of a null space algorithm in sparse quadratic programming, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 425-442.
2. K. Arrow, L. Hurwicz, and H. Uzawa, Studies in Nonlinear Programming, Stanford University Press, Stanford, CA, 1958.
3. Z. Bai and G. H. Golub, Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices, Ann. Numer. Math., 4 (1997), pp. 29-38.
4. R. E. Bank, B. D. Welfert, and H. Yserentant, A class of iterative methods for solving saddle point problems, Numer. Math., 55 (1990), pp. 645-666.
5. M. Benzi, Solution of equality-constrained quadratic programming problems by a projection iterative method, Rend. Mat. Appl. (7), 13 (1993), pp. 275-296.
6. M. Benzi and G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning, BIT, 39 (1999), pp. 417-438.
7. A. Bjorck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
8. J. H. Bramble, J. E. Pasciak, and A. T. Vassilev, Analysis of the inexact Uzawa algorithm for saddle point problems, SIAM J. Numer. Anal., 34 (1997), pp. 1072-1092.
9. F. Brezzi and M. Fortin, Mixed and Hybrid Finite Element Methods, Springer-Verlag, New York, 1991.
10. J. R. Bunch and B. N. Parlett, Direct methods for solving symmetric indefinite systems of linear equations, SIAM J. Numer. Anal., 8 (1971), pp. 639-655.
11. T. F. Chan, Deflated decomposition of solutions of nearly singular systems, SIAM J. Numer. Anal., 21 (1984), pp. 738-754.
12. N. Dyn and W. E. Ferguson, The numerical solution of equality-constrainted quadratic programming problems, Math. Comp., 41 (1983), pp. 165-170.
13. H. C. Elman, Preconditioning for the steady-state Navier-Stokes equations with low viscosity, SIAM J. Sci. Comput., 20 (1999), pp. 1299-1316.
14. H. C. Elman and G. H. Golub, Inexact and preconditioned Uzawa algorithms for saddle point problems, SIAM J. Numer. Anal., 31 (1994), pp. 1645-1661.
15. H. Elman and D. Silvester, Fast nonsymmetric iterations and preconditioning for Navier-Stokes equations, SIAM J. Sci. Comput., 17 (1996), pp. 33-46.
16. H. C. Elman, D. J. Silvester, and A. J. Wathen, Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations, Numer. Math., 90 (2002), pp. 641-664.
17. B. Fischer, A. Ramage, D. J. Silvester, and A. J. Wathen, Minimum residual methods for augmented systems, BIT, 38 (1998), pp. 527-543.
18. R. Fletcher, An ideal penalty function for constrained optimization, in Nonlinear Programming, 2, Academic Press, New York, 1974, pp. 121-163.
19. R. Fletcher, Practical Methods of Optimization, 2nd ed., Wiley, Chichester, UK, 1987.
20. R. Fletcher and T. Johnson, On the Stability of Null-Space Methods for KKT Systems, Numerical Analysis report NA/167, University of Dundee, Department of Mathematics and Computer Science, Dundee, UK, 1995.
21. A. Forsgren and W. Murray, Newton methods for large-scale linear equality-constrained minimization, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 560-587.
22. M. Fortin and R. Glowinski, Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, North-Holland, Amsterdam, 1983.
23. P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Inertia-controlling methods for general quadratic programming, SIAM Rev., 33 (1991), pp. 1-36.
24. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, New York, 1981.
25. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
26. G. H. Golub and G. Meurant, Matrices, moments and quadrature, in Numerical Analysis 1993, Pitman Res. Notes Math. Ser. 3, Longman Sci. Tech., Harlow, UK, 1993, pp. 105-156.
27. G. H. Golub and A. J. Wathen, An iteration for indefinite systems and its application to the Navier-Stokes equations, SIAM J. Sci. Comput., 19 (1998), pp. 530-539.
28. N. I. M. Gould, On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, Math. Programming, 32 (1985), pp. 90-99.
29. A. Greenbaum, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math., 17, SIAM, Philadelphia, 1997.
30. E. Haber, U. M. Ascher, and D. Oldenburg, On optimization techniques for solving nonlinear inverse problems, Inverse Problems, 16 (2000), pp. 1263-1280.
31. M. Hestenes, Conjugate Direction Methods in Optimization, Springer-Verlag, New York, 1980.
32. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
33. W. Karush, Minima of Functions of Several Variables with Inequalities as Side Conditions, Dissertation, Department of Mathematics, University of Chicago, Chicago, IL, 1939.
34. T. H. Kjeldsen, A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: The impact of World War II, Historia Math., 27 (2000), pp. 331-361.
35. A. Klawonn, An optimal preconditioner for a class of saddle point problems with a penalty term, SIAM J. Sci. Comput., 19 (1998), pp. 540-552.
36. A. Klawonn and O. B. Widlund, A domain decomposition method with Lagrange multipliers and inexact solvers for linear elasticity, SIAM J. Sci. Comput., 22 (2000), pp. 1199-1219.
37. P. Krzyzanowski, On block preconditioners for nonsymmetric saddle point problems, SIAM J. Sci. Comput., 23 (2001), pp. 157-169.
38. H. W. Kuhn and A. W. Tucker, Nonlinear programming, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, 1950, J. Neyman, ed., University of California Press, Berkeley, Los Angeles, 1951, pp. 481-492.
39. M. F. Murphy, G. H. Golub, and A. J. Wathen, A note on preconditioning for indefinite linear systems, SIAM J. Sci. Comput., 21 (2000), pp. 1969-1972.
40. J. Nocedal and S. Wright, Numerical Optimization, Springer-Verlag, New York, 1999.
41. I. Perugia, V. Simoncini, and M. Arioli, Linear algebra methods in a mixed approximation of magnetostatic problems, SIAM J. Sci. Comput., 21 (1999), pp. 1085-1101.
42. M. J. D. Powell, A Method for Nonlinear Constraints in Minimization Problems, Academic Press, London, 1969.
43. T. Rusten and R. Winther, A preconditioned iterative method for saddlepoint problems, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 887-904.
44. R. Sibson and G. Stone, Computation of thin plate splines, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 1304-1313.
45. G. W. Stewart, On the implicit deflation of nearly singular systems of linear equations, SIAM J. Sci. Statist. Comput., 2 (1981), pp. 136-140.
46. G. W. Stewart and J. Sun, Matrix Perturbation Theory, Academic Press, Boston, 1990.
47. G. Strang, Introduction to Applied Mathematics, Wellesley-Cambridge Press, Wellesley, MA, 1986.
48. G. Strang, A framework for equilibrium equations, SIAM Rev., 30 (1988), pp. 283-297.
49. R. S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.
50. A. J. Wathen, B. Fischer, and D. Silvester, The convergence of iterative solution methods for symmetric and indefinite linear systems, in Numerical Analysis 1997, Pitman Res. Notes Math. Ser. 380, Addison Wesley Longman Sci. Tech., Harlow, UK, 1997, pp. 230-243.