Rounding error analysis of the classical Gram-Schmidt orthogonalization process

Numerische Mathematik

Volumn 101, Issue 1, 2005, Pages 87-100

  Giraud, Luc ^a   Langou, Julien ^b   Rozložník, Miroslav ^c   Van Den Eshof, Jasper ^d  

^a CERFACS   (France)

^b University of Tennessee Knoxville   (United States)

^c INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^d HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22344449775     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00211-005-0615-4     Document Type: Article

References (24)

1. Abdelmalek, N.: Round off error analysis for Gram-Schmidt method and solution of linear least squares problems. BIT 11, 345-368 (1971)
2. Björck, Å.: Solving linear least squares problems by Gram-Schmidt orthogonalization. BIT 7, 1-21 (1967)
3. Björck, Å.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia, PA, 1996
4. Björck, Å., Paige, C.: Loss and Recapture of Orthogonality in the Modified Gram-Schmidt Algorithm. SIAM J. Matrix Anal. Appl 13(1), 176-190 (1992)
5. Daniel, J.W., Gragg, W.B., Kaufman, L., Stewart, G.W.: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization. Math. Comp 30, 772-795 (1976)
6. Dax, A.: A modified Gram-Schmidt algorithm with iterative orthogonalization and pivoting. Linear Alg. and its Appl 310, 25-42 (2000)
7. Frayssé, V., Giraud, L., Kharraz-Aroussi, H.: On the influence of the orthogonalization scheme on the parallel performance of GMRES. EUROPAR'98 Parallel Processing, Springer 1470, 751-762 (1998)
8. Frank, J., Vuik, C.: Parallel implementation of a multiblock method with approximate sub-domain solution. Appl. Num. Math 30, 403-423 (1999)
9. Giraud, L., Langou, J.: When modified Gram-Schmidt generates a well-conditioned set of vectors. IMA Journal of Numerical Analysis 22(4), 521-528
10. Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd ed. John Hopkins University Press, Baltimore, MD, 1996
11. Greenbaum, A., Rozložník, M., Strakoš, Z.: Numerical behaviour of the modified Gram-Schmidt GMRES implementation. BIT 37(3), 706-719 (1997)
12. Higham, N.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, PA, 2nd ed., 2002
13. Hoffmann, W.: Iterative Algorithms for Gram-Schmidt Orthogonalization. Computing 41, 335-348 (1989)
14. Jalby, W., Philippe, B.: Stability analysis and improvement of the block Gram-Schmidt algorithm. SIAM J. Sci. Stat. Comput 12, 1058-1073 (1991)
15. Kiełbasiński, A.: Numerical analysis of the Gram-Schmidt orthogonalization algorithm (Analiza numeryczna algorytmu ortogonalizacji Grama-Schmidta). (In Polish). Roczniki Polskiego Towarzystwa Matematycznego, Seria III: Matematyka Stosowana II, 15-35 (1974)
16. Kiełbasiński, A., Schwetlick, H.: Numerische lineare Algebra. Eine computerorientierte Einführung. (In German). Mathematik für Naturwissenschaft und Technik 18. Deutscher Verlag der Wissenschaften, Berlin, 1988
17. Kiełbasiński, A., Schwetlick, H.: Numeryczna algebra liniowa. (In Polish). Second edition. Wydawnictwo Naukowo-Techniczne, Warszawa, 1994
18. Lehoucq, R.B., Salinger, A.G.: Large-Scale Eigenvalue Calculations for Stability Analysis of Steady Flows on Massively Parallel Computers. Int. J. Numerical Methods in Fluids 36, 309-327 (2001)
19. Parlett, B.N.: The Symmetric Eigenvalue Problem. Englewood Cliffs, N.J., Prentice-Hall, 1980
20. Rice, J.R.: Experiments on Gram-Schmidt Orthogonalization. Math. Comp. 20, 325-328 (1966)
21. Rutishauser, H.: Description of Algol 60. Handbook for Automatic Computation, Vol. 1a. Springer Verlag, Berlin, 1967
22. Schmidt, E.: Über die Auflösung linearer Gleichungen mit unendlich vielen Unbekannten. (In German.) Rend. Cire. Mat. Palermo. Ser. 1, 25, 53-77 (1908)
23. Stewart, G.W.: Matrix Algorithms. Volume I: Basic Decompositions. SIAM, Philadelphia, PA, 1998
24. Wilkinson, J.H.: Modern error analysis. SIAM rev., 13(4), 548-569 (1971)