Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
暂无分享,去创建一个
[1] R. Varga,et al. Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods , 1961 .
[2] M. Newman,et al. Interpolation and approximation , 1965 .
[3] E. Cheney. Introduction to approximation theory , 1966 .
[4] J. Meijerink,et al. An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix , 1977 .
[5] Paul Nevai,et al. Distribution of zeros of orthogonal polynomials , 1979 .
[6] D. Smolarski. Optimum semi-iterative methods for the solution of any linear algebraic system with a square matrix , 1982 .
[7] Henk A. van der Vorst,et al. A Vectorizable Variant of some ICCG Methods , 1982 .
[8] Polynomial scaling in the conjugate gradient method and related topics in matrix scaling , 1982 .
[9] L. Adams. Iterative algorithms for large sparse linear systems on parallel computers , 1983 .
[10] Y. Saad,et al. Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals , 1983 .
[11] C. Micchelli,et al. Polynomial Preconditioners for Conjugate Gradient Calculations , 1983 .
[12] John Van Rosendale. Minimizing Inner Product Data Dependencies in Conjugate Gradient Iteration , 1983, ICPP.
[13] Lennart Johnsson. HIGHLY CONCURRENT ALGORITHMS FOR SOLVING LINEAR SYSTEMS OF EQUATIONS , 1984 .
[14] T. Jordan. CONJUGATE GRADIENT PRECONDITIONERS FOR VECTOR AND PARALLEL PROCESSORS , 1984 .
[15] G. Golub,et al. Block Preconditioning for the Conjugate Gradient Method , 1985 .