The Parallel Iterative Methods (PIM) package for the solution of systems of linear equations on para
暂无分享,去创建一个
[1] Gene H. Golub,et al. Matrix computations , 1983 .
[2] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .
[4] P. Sonneveld. CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems , 1989 .
[5] Jack J. Dongarra,et al. An extended set of FORTRAN basic linear algebra subprograms , 1988, TOMS.
[6] Stanley C. Eisenstat. A Note on the Generalized Conjugate Gradient Method , 1983 .
[7] Rudnei Dias da Cunha,et al. A study of iterative methods for the solution of systems of linear equations on transputer networks , 1992 .
[8] Roland W. Freund,et al. A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems , 1993, SIAM J. Sci. Comput..
[9] R. Fletcher. Conjugate gradient methods for indefinite systems , 1976 .
[10] Henk A. van der Vorst,et al. Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..
[11] E. F. DAzevedo,et al. Reducing communication costs in the conjugate gradient algorithm on distributed memory multiprocessors , 1992 .
[12] Tim Hopkins,et al. Parallel Preconditioned Conjugate-Gradients Methods on Transputer Networks , 1993 .
[13] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[14] Richard Barrett,et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.
[15] E. J. Craig. The N‐Step Iteration Procedures , 1955 .