Alternatives for Parallel Krylov Subspace Basis Computation

Numerical Linear Algebra with Applications

Volumn 4, Issue 4, 1997, Pages 305-331

  Sidje, Roger B ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

IBM SP2; Intel Paragon; Krylov subspace; Leja points; Parallel QR factorization; Sparse matrix

Indexed keywords

EID: 0031519150     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199707/08)4:4<305::AID-NLA104>3.0.CO;2-D     Document Type: Article

References (34)

1. Z. Bai, D. Hu and L. Reichel. An implementation of the GMRES method using QR factorization' , in Fifth SIAM Conference on Parallel Processing for Scientific Computing, J. Dongarra, K. Kenedy, P. Messina, D. C. Sorensen and R. G. Voigt, editors, Philadelphia, 1992.
2. Z. Bai, D. Hu and L. Reichel. A Newton basis GMRES implementation. IMA J. Numer. Anal., 14, 563-581, 1994.
3. S. T. Barnard and H. D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Technical Report RNR-91-008, NASA Ames Research Center, 1992.
4. Å. Björck. Numerics of Gram-Schmidt orthogonalization. Linear Algebra and its Applications, 197, 297-316, 1994.
5. F. Bodin, J. Erhel and T. Priol. Parallel sparse matrix vector multiplication using a shared virtual memory environment', in 6th SIAM Conference on Parallel Processing for Scientific Computing, 1993.
6. D. Calvetti, J. Petersen and L. Reichel. A parallel implementation of the GMRES method, in Numerical Linear Algebra, L. Reichel, A. Ruttan and R. S. Varga, editors, pp. 31-46. de Gruyter, Berlin, 1993.
7. E. Chu and A. George. QR factorization of a dense matrix on a shared-memory multiprocessor. Parallel. Comput., 11, 55-71, 1989.
8. E. Chu and A. George. QR factorization of a dense matrix on a hypercube multiprocessor. SIAM J. Sci. Stat. Comput., 11, 990-1028, 1990.
9. E. De Sturler and H. A. Van der Vorst. Communication cost reduction for Krylov methods on parallel computers, in Lecture Note In Computer Science 797, HPCN, W. Gentzsch and U. Harms, editors, Springer-Verlag, 1994.
10. J. J. Dongarra, A. H. Sameh and D. C. Sorensen. Implementation of some concurrent algorithms for matrix factorization. Parallel Comput., 3, 25-34, 1986.
11. I. S. Duff, R. G. Grimes and J. G. Lewis. Sparse matrix test problems. ACM Trans. Math. Softw., 15, 1-14, 1989.
12. J. Erhel. A parallel GMRES version for general sparse matrices. ETNA, 3, 160-176, 1995.
13. H. P. Flatt and K. Kennedy. Performance of parallel processors. Parallel Comput., 12, 1-20, 1989.
14. E. Gallopoulos and Y. Saad. Efficient solution of parabolic equations by Krylov approximation methods. SIAM J. Sci. Stat. Comput., 13(5), 1236-1264, 1992.
15. G. H. Golub and C. F. Van Loan. Matrix Computations, second edition. The Johns Hopkins University Press, Baltimore, 1989.
16. A. C. Hindmarsh and H. F. Walker. Note on a Householder implementation of the GMRES method. Technical Report UCID-20899, Lawrence Livermore National Laboratory, 1986.
17. W. Jalby and B. Philippe. Stability analysis and improvement of the block Gram-Schmidt algorithm. SIAM J. Sci. Stat. Comput., 12, 1058-1073, 1991.
18. S. K. Kim and A. T. Chronopoulos. An efficient Arnoldi method implemented on parallel computers, in 1991 Int. Conference on Parallel Processing, volume III, pp. 167-170, 1991.
19. J. G. Lewis and R. A. van de Geijn. Distributed memory matrix-vector multiplication and conjugate gradient algorithms. ACM, 484-492, 1993.
20. D. P. O'Leary and P. Whitman. Parallel QR factorization by Householder and modified Gram-Schmidt algorithms. Parallel Comput., 16, 99-112, 1990.
21. S. Petiton, Y. Saad, K. Wu and Ferng W.. Basic sparse matrix computations on the CM-5. International Journal of Modern Physics, 4(1), 65-83, 1994.
22. B. Philippe and R. B. Sidje. Parallel algorithms for the Arnoldi procedure, in Iterative Methods In Linear Algebra, II, volume 3, IMACS Series in Computational and Applied Mathematics, pp. 156-165, 1995.
23. A. Pothen and P. Raghavan. Distributed orthogonal factorization: Givens and Householder algorithms. SIAM J. Sci. Stat. Comput., 10, 1113-1135, 1989.
24. L. Reichel. Newton interpolation at Leja points. BIT, 30, 332-346, 1990.
25. Y. Saad. Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal., 29(1), 208-227, 1992.
26. A. H. Sameh. On some parallel algorithms on a ring of processors. Comput. Phys. Comm., 37, 159-166, 1985.
27. A. H. Sameh. Solving the linear least squares problem on a linear array of processors, in Algorithmically Specialized Computers, L. Synder, editor, pp. 191-200. Academic Press, NY, 1985.
28. J. N. Shadid and R. S. Tuminaro. A comparison of preconditioned nonsymmetric Krylov methods on a large-scale MIMD machine. SIAM J. Sci. Stat. Comput., 15(2), 440-459, 1994.
29. R. B. Sidje. Parallel algorithms for large sparse matrix exponentials: application to numerical transient analysis of Markov processes. Ph.D. thesis, University of Rennes 1, July 1994.
30. R. B. Sidje and B. Philippe. Parallel Krylov basis computation, in Actes du 2ème colloque CARI, INRIA & ORSTOM, 1994.
31. G. W. Stewart. The economical storage of plane rotations. Numer. Math., 25, 137-138, 1976.
32. O. Temam and W. Jalby. Characterizing the behavior of sparse algorithms on caches. Supercomputing, 1992.
33. H. Walker and L. Zhou. A simpler GMRES. Num. Lin. Alg. Appl., 1(16), 571-581, 1994.
34. J. Zhu. QR factorization for the regularized least squares problem on hypercubes. Parallel Comput., 19, 939-948, 1993.