Minimal Residual Method Stronger than Polynomial Preconditioning
暂无分享,去创建一个
Thomas A. Manteuffel | Emanuel Knill | Wayne Joubert | Vance Faber | W. Joubert | T. Manteuffel | V. Faber | E. Knill
[1] W. Joubert,et al. Iterative methods for nonsymmetric linear systems , 1990 .
[2] Anne Greenbaum,et al. Max-Min Properties of Matrix Factor Norms , 1994, SIAM J. Sci. Comput..
[3] A. Greenbaum. Comparison of splittings used with the conjugate gradient algorithm , 1979 .
[4] W. Joubert,et al. Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory , 1992 .
[5] Charles R. Johnson. The Theory of Matrices. Second Edition (with Applications) (Peter Lancaster and Miron Tismenetsky) , 1987 .
[6] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .
[7] Graham F. Carey,et al. Parallelizable Restarted Iterative Methods for Nonsymmetric Linear Systems , 1991, PPSC.
[8] Peter Lancaster,et al. The theory of matrices , 1969 .
[9] T. Manteuffel,et al. A taxonomy for conjugate gradient methods , 1990 .
[10] Alston S. Householder,et al. The Theory of Matrices in Numerical Analysis , 1964 .
[11] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .
[12] Wayne Joubert,et al. A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems , 1994, SIAM J. Sci. Comput..
[13] Wayne Joubert,et al. On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems , 1994, Numer. Linear Algebra Appl..