Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures

References

• Anderson E. C. Saad Y. Solving sparse triangular system on parallel computer University of Illinois CSRD Urbana, IL 1988 Technical report
   Google Scholar
• Ashby , S. , Manteuffel , T. and Saylor , P. 1990 . A taxonomy for conjugate gradient method . SIAM J. Numerical Analysis , 27 : 1542 – 1568 .
   Web of Science ®Google Scholar
• Ashcraft , C. and Grimes , R. 1988 . On vectorizing incomplete factorization and SSOR preconditioners . SIAM Journal of Sci. Stat. Computing , 9 : 122 – 151 .
   Web of Science ®Google Scholar
• Duff , I. and Meurant , G. A. 1986 . The effect or ordering on preconditioned conjugate gradients . BIT , 29 : 635 – 657 .
   Google Scholar
• Duff , I. S. , Erisman , M. and Reid , J. K. 1986 . Direct Methods for Sparse Matrices , Oxford University Press .
   Google Scholar
• Gibbs , N. , Poole , W. and Stockmeyer , P. 1976 . An algorithm for reducing the bandwidth and profile of a sparse matrix . SIAM Journal on Numerical Analysis , 13 ( 2 ) : 236 – 250 .
   Web of Science ®Google Scholar
• Gibbs , N. , Poole , W. and Stockmeyer , P. 1976 . A comparison of several bandwidth and profile reduction algorithms . A CM Transactions on Mathematical Software , 2 ( 4 ) : 322 – 330 .
   Google Scholar
• Golub , G. and Van Loan , C. 1990 . Matrix Computations , The Johns Hopkins University Press .
   Google Scholar
• Hageman , L. and Young , D. 1981 . Applied Iterative Methods. , Academic Press .
   Google Scholar
• Heroux M. Vu P. Yang C. A parallel preconditioned conjugate gradient package for solving sparse linear systems on a CRAY-YMP Cray Research Inc. 1991 Technical report
   Google Scholar
• Hestenes , M. R. and Stiefel , E. L. 1952 . Methods of conjugate gradient for solving linear system . J. Res. Nat. Bur. Standards , 49 : 409 – 436 .
   Google Scholar
• Johnson , O. G. , Micchelli , C. A. and Paul , G. 1983 . Polynomial preconditioners for conjugate gradient calculations . SIAM J. Numerical Analysis , 20 : 362 – 376 .
   Web of Science ®Google Scholar
• Liu , W. and Sherman , A. 1976 . Comparative analysis for the Cuthill-Mc Kee and reverse Cuthill-McKee ordering algorithms for sparse matrices . SIAM Journal on Numerical Analysis , 13 : 198 – 213 .
   Web of Science ®Google Scholar
• Ma , S. and Chronopoulos , A. T. 1990 . Implementation of iterative methods for large sparse nonsymmetric linear systems on a parallel vector machine . The International Journal of Supercomputer Applications , 4 : 9 – 24 .
   Google Scholar
• Meijerink , J. A. and van der Vorst , H. 1977 . An iterative solution method for linear systems of which the coefficient matrix is a symmetric . M-matrix Math. Computing , 31 : 148 – 162 .
   Web of Science ®Google Scholar
• Meurant G. Numerical experiments for the preconditioned conjugate gradient method on the CRAY X-MP/2 University of California Berkeley 1984 Technical report
   Google Scholar
• Paolini , G. V. and Radicati di Brozolo , G. 1989 . Data structures to vectorize CG algorithms for general sparsity patterns . BIT , 29 : 703 – 718 .
   Google Scholar
• Radicati di Brozolo , G. and Robert , Y. 1989 . Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on vector multiprocessors . Parallel Computing , 11 : 223 – 239 .
   Google Scholar
• Saad , Y. 1988 . Practical use of polynomial for the conjugate gradient method . SIAM Journal of Sci Stat. Computing , 6 : 865 – 881 .
   Google Scholar
• Saad , Y. 1989 . Krylov subspace methods on supercomputers . SIAM Journal of Sci. Stat. Computing , 10 : 1200 – 1232 .
   Web of Science ®Google Scholar
• Saad , Y. and Schultz , M. H. 1986 . GMRES: a generalized minimum residual algorithm for solving nonsymmetric linear systems . SIAM J. Sci. Stat. Computing , 7 ( 3 ) : 856 – 869 .
   Web of Science ®Google Scholar
• Saltz J. H. Automated problem scheduling and reduction of synchronization delay effects Hampton 1987 Technical report, ICASE
   Google Scholar
• Seager , M. K. 1986 . Parallelizing conjugate gradient for the CRAY X-MP . Parallel Computing , 3 ( 3 ) : 35 – 47 .
   Web of Science ®Google Scholar
• Sonneveld , P. 1989 . CGS, a fast Lanczos type solver for nonsymmetric linear systems . SIAM J. Sci. Stat. Computing , 10 ( 1 ) : 36 – 52 .
   Web of Science ®Google Scholar
• van der Vorst H. ICCG and related methods for 3D problems on vector computers Kyoto University Kyoto, Japan 1987 Technical report,
   Google Scholar
• van der Vorst , H. 1987 . Large tridiagonal and block tridiagonal linear systems on vector and parallel computers . Parallel Computing , 5 ( 1 ) : 45 – 54 .
   Web of Science ®Google Scholar
• van der Vorst H. Sonneveld P. CGSTAB: a more smoothly converging variant of CGS Delft University of Technology, Delft The Netherlands May 1990 Technical report
   Google Scholar