Implicit conjugate-gradient solvers on distributed-memory architectures
暂无分享,去创建一个
[1] Dimitri J. Mavriplis,et al. Implicit Solvers for Unstructured Meshes , 1993 .
[2] Vaidy S. Sunderam,et al. PVM: A Framework for Parallel Distributed Computing , 1990, Concurr. Pract. Exp..
[3] John N. Shadid,et al. Sparse iterative algorithm software for large-scale MIMD machines: An initial discussion and implementation , 1992, Concurr. Pract. Exp..
[4] Roland W. Freund,et al. Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices , 1992, SIAM J. Sci. Comput..
[5] 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..
[6] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[7] Lloyd N. Trefethen,et al. How Fast are Nonsymmetric Matrix Iterations? , 1992, SIAM J. Matrix Anal. Appl..
[8] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .
[9] P. Sonneveld. CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems , 1989 .
[10] Anthony T. Chronopoulos. s-Step Iterative Methods for (Non) Symmetric (In) Definite Linear Systems , 1989, PPSC.
[11] Meng-Sing Liou,et al. Preconditioned conjugate gradient methods for the Navier-Stokes equations , 1994 .