Residual Smoothing Techniques for Iterative Methods
暂无分享,去创建一个
[1] Tony F. Chan,et al. A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems , 1994, SIAM J. Sci. Comput..
[2] Willi Schönauer,et al. Scientific computing on vector computers , 1987, Special topics in supercomputing.
[3] Roland W. Freund,et al. A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems , 1993, SIAM J. Sci. Comput..
[4] Martin H. Gutknecht,et al. Changing the norm in conjugate gradient type algorithms , 1993 .
[5] Paul N. Swarztrauber,et al. EFFICIENT FORTRAN SUBPROGRAMS FOR THE SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS , 1981 .
[6] R. Freund,et al. QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .
[7] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .
[8] P. Sonneveld. CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems , 1989 .
[9] Roland A. Sweet,et al. Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3] , 1979, TOMS.
[10] C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .
[11] Rüdiger Weiss,et al. Convergence behavior of generalized conjugate gradient methods , 1990 .
[12] R. Fletcher. Conjugate gradient methods for indefinite systems , 1976 .