On numerical stability in large scale linear algebraic computations

ZAMM Zeitschrift fur Angewandte Mathematik und Mechanik

Volumn 85, Issue 5, 2005, Pages 307-325

  Strakos Z ^a   Liesen, J ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Accuracy; Backward error; Conjugate gradient method; Convergence; Eigenvalue problems; GMRES method; Lanczos method; Linear algebraic systems; Numerical stability

Indexed keywords

EID: 18744368099     PISSN: 00442267     EISSN: None     Source Type: Journal    
DOI: 10.1002/zamm.200410185     Document Type: Article

References (83)

1. M. Arioli, I. S. Duff, and D. Ruiz, SIAM J. Matrix Anal. Appl. 10, 138-144 (1992).
2. M. Arioli, Numer. Math. 97, 1-24 (2004).
3. M. Arioli, D. Loghin, and A. J. Wathen, Numer. Math. 99, 381-410 (2005).
4. M. Arioli, E. Noulard, and A. Russo, Calcolo 38, 97-112 (2001).
5. O. Axelsson, Linear Algebra Appl. 29, 1-16 (1980).
6. O. Axelsson, Numer. Math. 51, 209-227 (1987).
7. I. Babuška, Mathematics of the verification and validation in computational engineering, Proceedings of the Conference Mathematical and Computer Modelling in Science and Engineering, edited by M. Koč andrlová and V. Kelar, Union of Czech Mathematicians and Physicists, Prague (2003), pp. 5-12.
8. R. Barrett, M. Berry, T.F. Chan, J. Demmel, J. Donate, J. Dongarra, V. Eijkhout, R. Pozzo, C. Romine, and H.A. van derVorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods (SIAM, Philadelphia, 1995).
9. B. Beckermann and A. Kuijlaars, ETNA 14, 1-19 (2002).
10. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation (Springer-Verlag, New York, 1999).
11. A.N. Brooks and T.J.R. Hughes, Comput. Methods Appl. Mech. Eng. 32, 199-259 (1982).
12. D. Calvetti, S. Morigi, L. Reichel, and F. Sgallari, Numer. Algorithms 25, 79-88 (2000).
13. F. Cucker, Real Computations with Fake Numbers, Lecture Notes in Computer Science 1644 (Springer Verlag, Berlin, 1999), pp. 55-73.
14. G. Dahlquist, G. H. Golub, and S. G. Nash, Bounds for the error in linear systems, in: Proceedings of the Workshop on Semi-Infinite Programming, edited by R. Hettich (Springer Verlag, Berlin, 1978), pp. 154-172.
15. J. Drkošová, A. Greenbaum, M. Rozložník, and Z. Strakoš, BIT 35, 309-330 (1995).
16. M. Eiermann, Semiiterative Verfahren für nichtsymmetrische lineare Gleichungssysteme, Habilitationsschrift, Universität Karlsruhe (1989).
17. S. C. Eisenstat, H. C. Elman, and M. H. Schultz, SIAM J. Numer. Anal. 20, 345-357 (1983).
18. H.C. Elman, Iterative methods for large sparse, nonsymmetric systems of linear equations, Ph.D. Thesis, Yale University (1982).
19. H. C. Elman and A. Ramage, Math. Comput. 72, 263-288 (2001).
20. H. C. Elman and A. Ramage, SIAM J. Numer. Anal. 40, 254-281 (2002).
21. O. G. Ernst, SIAM J. Matrix Anal. Appl. 21, 1079-1101 (2000).
22. B. Fischer and G. H. Golub, On the error computation for polynomial based iteration methods, in: Recent Advances in Iterative Methods, edited by G. H. Golub, A. Greenbaum, and M. Luskin (Springer-Verlag, New York, 1994), pp. 59-67.
23. B. Fischer, A. Ramage, D. Silvester, and A. J. Wathen, Comput. Methods Appl. Mech. Eng. 179, 179-195 (1999).
24. V. Fraysé, L. Giraud, S. Gratton, and J. Langou, A set of GMRES routines for real and complex arithmetic on high performance computers, CERFACS Technical Report TR/PA/03/3 (2003).
25. G. H. Golub and G. Meurant, Matrices, moments and quadrature, in: Numerical Analysis 1993, Pitman Research Notes in Mathematics Series 303, edited by D. Griffiths and G. Watson (Longman Sci. Tech. Publ., Harlow, 1994), pp. 105-156.
26. G.H. Golub and G. Meurant, BIT 37, 687-705 (1997).
27. G.H. Golub and Z. Strakoš, Numer. Algorithms 8, 241-268 (1994).
28. A. Greenbaum, Linear Algebra Appl. 113, 7-63 (1989).
29. A. Greenbaum, The Lanczos and conjugate gradient algorithms in finite precision arithmetic, in: Proceedings of the Cornelius Lanczos Centennary Conference (SIAM, Philadephia, 1994), pp. 49-60.
30. A. Greenbaum, Iterative methods for solving linear systems, Frontiers in Applied Mathematics (SIAM, Philadelphia, PA. 1997).
31. A. Greenbaum and Z. Strakoš, SIAM J. Matrix Anal. Appl. 13, 121-137 (1992).
32. A. Greenbaum, M. Rozloňník, and Z. Strakoš, BIT 37, 706-719 (1997).
33. A. Greenbaum, J. DuinterTebbens, and Z. Strakoš, GMRS and ideal GMRS for a convection-diffusion matrices model problem, in preparation.
34. W. Hackbusch, Iterative Solution of Large Sparse Systems of Equations, Applied Mathematical Sciences 95 (Springer-Verlag, New York, 1994); translated and revised from the 1991 German original.
35. C. Hegedüs, Private communication (1998).
36. M.R. Hestenes and E. Stiefel, J. Res. Natl. Bur. Stand. (USA) 49, 409-436 (1952).
37. N.J. Higham, Accuracy and stability of numerical algorithms (SIAM Publications, Philadelphia, 1996).
38. T.J.R. Hughes and A. Brooks, A multidimensional upwind scheme with no crosswind diffusion, in: Finite Element Methods for Convection Dominated Flows (Papers, Winter Ann. Meeting Amer. Soc. Mech. Engs., New York, 1979), Vol. 34 of AMD (Amer. Soc. Mech. Eng. (ASME), New York, 1979), pp. 19-35.
39. I. C. Ipsen, BIT 40, 524-536 (2000).
40. A. Iserles, SIAM Rev. 42, 739-745 (2000).
41. I.M. Khabaza, Comput. J. 6, 202-206 (1963/1964).
42. C. Lanczos, J. Res. Natl. Bur. Stand. (USA) 45, 255-282 (1950).
43. J. Liesen, M. Rozložník and Z. Strakoš, SIAM J. Sci. Comput. 23, 1503-1525 (2002).
44. J. Liesen and Z. Strakoš, PAMM 3, 551-552 (2003).
45. J. Liesen and Z. Strakoš, submitted to SIAM J. Sci. Comput. (2004).
46. J. Liesen and P. Tichý, Behavior of Krylov subspace methods for symmetric tridiagonal Toeplitz matrices, Preprint 34-2004, Institute of Mathematics, Technical University of Berlin, 2004.
47. G. Meurant, Numer. Algorithms 16, 77-87 (1997).
48. K. W. Morton, Numerical Solution of Convection-Diffusion Problems, Chapman & Hall, London, (1996).
49. J.T. Oden, J.C. Browne, I. Babuška, K.M. Liechti, and L.F. Demkowicz, A Computational Infrastructure for Reliable Computer Simulations, Lecture Notes in Computer Science 2660 (Springer Verlag, Heidelberg, 2003), pp. 385-392.
50. C.C. Paige, The compution of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. Thesis, Institute of Computer Science, University of London, London, UK (1971).
51. C.C. Paige, J. Inst. Maths. Appl. 10, 373-381 (1972).
52. C.C. Paige, J. Inst. Math. Appl. 18, 341-349 (1976).
53. C.C. Paige and M. A. Saunders, ACM Trans. Math. Softw. 8, 43-71 (1982).
54. C.C. Paige and M.A. Saunders, ACM Trans. Math. Softw. 8, 195-209 (1982).
55. C.C. Paige, Linear Algebra Appl. 34, 235-258 (1980).
56. C.C. Paige, M. Rozložník and Z. Strakoš, Rounding error analysis of the modified Gram-Schmidt GMRES, in preparation (2004).
57. C. C. Paige and Z. Strakoš, Numer. Math. 91, 117-146 (2002).
58. C. C. Paige and Z. Strakoš, Numer. Math. 91, 93-115 (2002).
59. C.C. Paige and Z. Strakoš, SIAM J. Sci. Comput. 23, 1898-1923 (2002).
60. B. N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall Series in Computational Mathematics (Prentice-Hall Inc., Englewood Cliffs, N.J., 1980).
61. B.N. Parlett, The contribution of J.H. Wilkinson to numerical analysis, in: A History of Scientific Computing, ACM Press Hist. Ser. (ACM, New York, 1990), 17-30.
62. B.N. Parlett, Do we fully understand the symmetric Lanczos algorithm yet?, in: Proceedings of the Cornelius Lanczos Centenary Conference (SIAM, Philadelphia, 1994), pp. 93-107.
63. M. Rigal and J. Gaches, J. Assoc. Comput. Mach. 14, 543-548 (1967).
64. M. Rozložník, Numerical stability of the GMRES method, Ph.D. Thesis, Institute of Computer Science AS CR, Prague, Czech Republic (1997).
65. M. Rozložník and Z. Strakoš, Variants of the residual minimizing Krylov space methods, in: Proceedings of the XI-th Summer School on Software and Algorithms of Numerical Mathematics, edited by I. Marek (1995), pp. 208-225.
66. M. Rozložník, Z. Strakoš, and M. Tůma, On the role of orthogonality in the GMRES method, in: Proceedings of SOFSEM'96, Lecture Notes in Computer Science 1175 (Springer Verlag, Heidelberg, 1996), pp. 409-416.
67. Y. Saad and M.H. Schultz, SIAM J. Sci. Stat. Comput. 7, 856-869 (1986).
68. S. Smale, Complexity theory and numerical analysis, in: Acta Numerica 6 (Cambridge Univ. Press, Cambridge, 1997), pp. 523-551.
69. E. Stein (ed.), Error-controlled Adaptive Finite Elements in Solid Mechanics (John Wiley & Sons Ltd, Chichester, 2003).
70. Z. Strakoš, Convergence and numerical behaviour of the Krylov space methods, NATO ASI Institute Algorithms for Large Sparse Linear Algebraic Systems: The State of the Art and Applications in Science and Engineering, edited by G. Winter Althaus and E. Spedicato, (Kluwer Academic Press, Dordrecht, 1998), pp. 175-197.
71. Z. Strakoš and P. Tichý, ETNA 13, 56-80 (2002).
72. Z. Strakoš and P. Tichý, PAMM 3, 553-554 (2003).
73. Z. Strakoš and P. Tichý, Error estimation in preconditioned conjugate gradients, submitted to BIT Numerical Mathematics (2004).
74. G. W. Strang and G. J. Fix, An Analysis of the Finite Element Method (Prentice-Hall, Englewood Cliffs, N.J., 1973).
75. A. van der Sluis, Numer. Math. 14, 14-23 (1969).
76. P. Vinsome, Orthomin, an iterative method for solving sparse sets of simultaneous linear equations, in: Proceedings of the Fourth Symposium on Reservoir Simulation (Society of Petroleum Engineers of AIME, Los Angeles, 1976), pp. 149-159.
77. H.F. Walker and L. Zhou, Numer. Lin. Alg. Appl. 1, 571-581 (1994).
78. K. F. Warnick, Nonincreasing error bound for the biconjugate gradient method, unpublished report, University of Illinois at Urbana-Champaign (2000).
79. J.H. Wilkinson, Rounding Errors in Algebraic Processes (Her Majesty's Stationery Office, London, 1963).
80. J. H. Wilkinson, The Algebraic Eigenvalue Problem (Oxford University Press, Oxford, 1965).
81. B.I. Wohlmuth and R.H.W. Hoppe, Math. Comput. 68, 1347-1378 (1999).
82. D.M. Young, Iterative Solution of Large Linear Systems (Academic Press, New York, 1971).
83. D.M. Young and K.C. Jea, Linear Algebra Appl. 34, 159-194 (1980).