Expanded systems and the ILU preconditioner for solving non-Hermitian linear systems

Linear Algebra and Its Applications

Volumn 293, Issue 1-3, 1999, Pages 243-256

  Ayachour, E H ^a  

^a UNIV LILLE   (France)

Author keywords

Hermitian expanded systems; ILU preconditioner; Lanczos process; MINRES

Indexed keywords

EID: 0033455843     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(99)00050-6     Document Type: Article

References (19)

1. E.H. Ayachour, A new Hermitian preconditioner of the methods CGNR and CGNE based on an incomplete Cholesky decomposition, in preparation.
2. Z. Bai, D. Hu, L. Reichel, A Newton basis GMRES implementation, IMA J. Numer. Anal. 14 (1994) 563-581.
3. P.N. Brown, A theoretical comparison of the Arnoldi and the GMRES algorithms, SIAM J. Sci. Stat. Comput. 12 (1991) 58-78.
4. J.K. Cullum, Peaks, plateaus, numerical instabilities in Galerkin/minimal residual pair of methods for solving Ax = b, Appl. Numer. Math. 19 (1995) 255-278.
5. J.K. Cullum, A. Greenbaum, Relations between Galerkin and norm-minimizing iterative methods for solving linear systems, SIAM J. Matrix Anal. Appl. 17 (1996) 223-247.
6. F.E. Ehlers, W.H. Weatherill, E.L. Yip, Development and application of algorithms for calculating the transonic flow about harmonically oscillating wings, Tech. Report, The Boeing commercial Aireplane Company, Seattle, WA, 1983.
7. G.H. Golub, W. Kahan, Calculating the singular values and pseudoinverse of a matrix, SIAM J. Numer. Anal. 2 (1965) 205-224.
8. M.R. Hestenes, E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards. 49 (1952) 409-435.
9. N.M. Nachtigal, L. Reichel, L.N. Trethen, A hybrid GMRES algorithm for nonsymmetric linear systems, SIAM J. Matrix Anal. Appl. 13 (1992) 796-825.
10. C.C. Paige, Computational variants of the Lanczos method for the eigenproblem, J. Inst. Math. Appl. 10 (1972) 373-381.
11. C.C. Paige, M.A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975) 617-629.
12. C.C. Paige, M.A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Softw. 8 (1982) 43-71.
13. S. Petiton, C. Weill-Duflos, Massively parallel preconditioners for the sparse conjugate gradient method, Y.R.M. Cosnard, D. Trystram, Parallel Processing: COMPAR92-VAPP V, L. Bougé (Ed.), Springer, Berlin, 1992, pp. 373-378.
14. Y. Saad, M.H. Schultz, GMRES : a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7 (1986) 856-869.
15. Y. Saad, Krylov subspace methods on supercomputers, SIAM J. Sci. Stat. Comput. 10 (1989) 1200-1232.
16. Y. Saad, ILUT: A dual threshold incomplete ILU factorization, Linear Algebra Appl. 1 (1994) 387-402.
17. H. Sadok, private communication.
18. M.A. Saunders, Solution of sparse rectangular systems using LSQR and GRAIG, BIT 35 (1995) 588-604.
19. M.A. Saunders, H.D. Simon, E.L. Yip, Two conjugate-gradient-type methods for unsymmetric linear equations, SIAM J. Numer. Anal. 25 (1988) 927-940.