Explicitly preconditioned conjugate gradient method for the solution of unsymmetric linear systems

References

• Saltz , J. , Crowley , K. , Mirchandaney , R. and Berryman , H. 1990 . Run-time scheduling and execution of loops on message passing machines . J. Parall. Distr. Comput. , 8 : 739 – 747 .
   Web of Science ®Google Scholar
• Concus , P. , Golub , G. O. and O' Leary , D. 1976 . “ A generalized conjugate gradient method for numerical solution of elliptic partial differential equations ” . In Sparse Matrix Computations , 309 – 332 . N.Y : Academic Press .
   Google Scholar
• Axelsson , O. 1976 . A class of iterative methods for finite element equations . Computer Meth. Appl. Mech. Engrg. , 9 : 123 – 137 .
   Google Scholar
• Kaporin I. E. An alternative approach to estimating the iteration number of conjugate gradient method Numerical Methods and Software Kuznetsov Ju A. Academy of Science of the USSR, Department of Computational Mathematics Moscow 1990 53 72 In Russian
   Google Scholar
• Kaporin , I. E. 1990 . On preconditioning the conjugate gradient method when solving discrete analogues of differential problems . Differents. Uravn , 26 : 1225 – 1236 . In Russian
   Web of Science ®Google Scholar
• Shestakov , A. I. and Anderson , D. V. 1983 . ILUCG2: Subprograms for the solution of a linear asymmetric matrix arising from a 9-point discretization . Comp. Phys. Comm. , 30 : 31 – 36 .
   Web of Science ®Google Scholar
• Saad , Y. 1988 . Preconditioning techniques for nonsymmetric and indefinite linear systems . J. Comp. Appl Math. , 24 : 89 – 105 .
   Web of Science ®Google Scholar
• George , A. and Liu , J. W. H. 1981 . Computer Solution of Large Sparse Positive Definitive Systems , Englewood Cliffs, N.J : Prentice-Hall .
   Google Scholar
• Sinkhorn , R. 1964 . A relationship between arbitrary positive matrices and doubly stochastic matrices . Ann. Math. Statist. , 35 : 876 – 879 .
   Google Scholar
• Marshall , A. W. and Olkin , I. 1968 . Scaling of matrices to achieve specified row and column sums . Numer. Math. , 12 : 83 – 90 .
   Web of Science ®Google Scholar
• Hageman , L. A. and Young , D. M. 1981 . New York : Academic Press .
   Google Scholar
• Ortega , J. 1988 . Introduction to Parallel and Vector Solution of Linear Systems , N.Y : Plenum Press .
   Google Scholar
• Kamath , C. and Sameh , A. 1988/1989 . A projection method for solving nonsymmetric linear systems on multiprocessors . Parallel Computing , 9 : 291 – 312 .
   Web of Science ®Google Scholar
• Manteuffel , T. A. 1980 . An incomplete factorization technique for positive definite systems . Math. Comput , 34 : 473 – 497 .
   Web of Science ®Google Scholar
• Sameh A. Bramley R. Domain Decomposition for Parallel Row Projection Algorithms Center for Supercomputing Research and Development, Univ. of Illinois Urbana, IL January 1990 CRSD Rept. No. 958
   Google Scholar
• Saad , Y. and Schultz , M. H. 1986 . GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems . SIAM J. Sci. Statist. Comput. , 7 : 856 – 869 .
   Web of Science ®Google Scholar
• Sonneveld , P. 1989 . CGS, a fast Lanczos-type solver for nonsymmetric linear systems . SIAM J. Sci. Statist. Comput. , 10 : 36 – 52 .
   Web of Science ®Google Scholar
• Van der Vorst , H. A. 1981 . Iterative solution methods for certain sparse linear systems with a non-symmetric matrix arising from PDE-problems . J. Comput. Phys. , 44 : 1 – 19 .
   Web of Science ®Google Scholar
• Eisenstat , S. C. 1981 . Efficient implementation of a class of preconditioned conjugate gradient methods . SIAM J. Sci. Statist. Comput. , 2 : 1 – 4 .
   Web of Science ®Google Scholar
• Elman , H. C. 1989 . Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems . BIT , 29 : 890 – 915 .
   Web of Science ®Google Scholar
• Gustafson , J. , Montry , G. and Benner , R. 1988 . Development of parallel methods for a 1024-processor hypercube . SIAM J. Sci. Statist. Comput. , 9 : 609 – 638 .
   Web of Science ®Google Scholar