A block orthogonalization procedure with constant synchronization requirements

SIAM Journal on Scientific Computing

Volumn 23, Issue 6, 2002, Pages 2165-2182

  Stathopoulos, Andreas ^a   Wu, Kesheng ^b  

^a The College of William and Mary   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Gram Schmidt; Householder; Orthogonalization; Poincar ; QR factorization; Singular value decomposition

Indexed keywords

ERROR ANALYSIS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; VECTORS;

ORTHOGONALIZATION;

COMPUTATION THEORY;

EID: 0036447603     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827500370883     Document Type: Article

References (24)

1. Å. Björck, Solving linear least squares problems by Gram-Schmidt orthogonalization, BIT, 7 (1967), pp. 1-21.
2. Å. Björck, Numerics of Gram-Schmidt orthogonalization, Linear Algebra Appl., 198 (1994), pp. 297-316.
3. Å. Björck and C.C. Paige, Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 176-190.
4. L.S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R.C. Whaley, ScaLAPACK User's Guide, SIAM, Philadelphia, 1997.
5. S. Chaturvedi, A.K. Kapoor, and V. Srinivasan, A New Orthogonalization Procedure with an Extremal Property, Technical Report quant-ph/9803073, LACS Stanford, Palo Alto, CA, 1998.
6. C.K. Chui, Wavelet Analysis and Its Applications, Academic Press, San Diego, 1992.
7. J.W. Daniel, W.B. Gragg, L. Kaufman, and G.W. Stewart, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-795.
8. J. Dongarra, J. Ducrouz, I. Duff, and S. Hammarling, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Software, 16 (1990), pp. 1-17.
9. J. Dongarra, J. Ducrouz, S. Hammarling, and R. Hanson, An extended set of FORTRAN basic linear algebra subprograms, ACM Trans. Math. Software, 14 (1988), pp. 1-32.
10. W. Gander, Algorithms for the QR Decomposition, Technical Report TH 80-02, Angewandte Mathematik, ETH Zurich, Zurich, Switzerland, 1980.
11. G.H. Golub and C.F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1989.
12. G.H. Golub and R. Underwood, The block Lanczos method for computing eigenvalues, in Mathematical Software III, J.R. Rice, ed., Academic Press, New York, 1977, pp. 361-377.
13. W. Hoffman, Iterative algorithms for Gram-Schmidt orthogonalization, Computing, 41 (1989), pp. 335-348.
14. W. Jalby and B. Philippe, Stability analysis and improvement of the block Gram-Schmidt algorithm, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 1058-1073.
15. C. Lawson, R. Hanson, D. Kincaid, and F. Krogh, Basic linear algebra subprograms for FORTRAN usage, ACM Trans. Math. Software, 5 (1979), pp. 308-325.
16. P.O. Lödwin, J. Chem. Phys., 18 (1950), p. 365.
17. P.O. Lödwin, Adv. Quant. Chem., 23 (1992), p. 84.
18. B.N. Parlett, The Symmetric Eigenvalue Problem, SIAM, Philadelphia, 1997.
19. Y. Saad, Iterative methods for sparse linear systems, PWS, 1996.
20. H.C. Schweinler and E.P. Wiener, Orthogonalization methods, J. Math. Phys., 11 (1970), p. 1693.
21. J.P. Singh, D.E. Culler, and A. Gupta, Parallel Computer Architecture. A Hardware/Software Approach, Morgan Kaufmann, San Francisco, 1999.
22. A. Stathopoulos and J.R. McCombs, A parallel, block, Jacobi-Davidson implementation for solving large eigenproblems on coarse grain environments, in Proceedings of the 1999 Inter-national Conference on Parallel and Distributed Processing Techniques and Applications, CSREA Press, 1999, pp. 2920-2926.
23. R.C. Whaley and J.J. Dongarra, Automatically Tuned Linear Algebra Software, Technical Report UT-CS-97-366, University of Tennessee, Knoxville, TN, 1997.
24. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, England, 1965.