The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems

Advances in Engineering Software

Volumn 33, Issue 7-10, 2002, Pages 611-619

  Florez E ^a   Garcia M D ^a   Gonzalez L ^a   Montero, Gustavo ^a  

^a UNIVERSITY OF LAS PALMAS DE GRAN CANARIA   (Spain)

Author keywords

Iterative solvers; Non symmetric linear systems; Preconditioning; Reordering techniques; Sparse approximate inverse

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; PARTIAL DIFFERENTIAL EQUATIONS;

KRYLOV SUBSPACE METHOD;

LINEAR SYSTEMS;

EID: 0036663124     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(02)00070-4     Document Type: Conference Paper

References (30)

1. Grote M., Huckle T. Parallel preconditioning with sparse approximate inverses. SIAM J Sci Comput. 18:(3):1997;838-853.
2. Montero G., González L., Flórez E., García M.D., García A., Suárez A. Approximate inverse computation using Frobenius inner product. Numer Lin Alg Appl. 9:2002;239-247.
3. Benzi M., Tůma M. Orderings for factorized sparse approximate inverse preconditioners. SIAM J Sci Comput. 21:(5):2000;1851-1868.
4. Bridson R., Tang W.-P. Ordering, anisotropy, and factored sparse approximate inverses. SIAM J Sci Comput. 21:(3):1999;867-882.
5. Benzi M., Szyld D.B., van Duin A. Orderings for incomplete factorization preconditioning of nonsymmetric problems. SIAM J Sci Comput. 20:(5):1999;1652-1670.
6. Benzi M., Joubert W., Mateesen G. Numerical experiments with parallel orderings for ILU preconditioners. Electr Trans Numer Anal. 8:1999;88-114.
7. Dutto L.C. The effect of ordering on preconditioned GMRES algorithm, for solving the compressible Navier-Stokes equations. Int J Numer Meth Engng. 36:1993;457-497.
8. George A., Liu J.W. The evolution of the minimum degree ordering algorithms. SIAM Rev. 31:1989;1-19.
9. George A. Computer implementation of the finite element method. PhD Thesis. Department of Computer Science, Stanford University, Stanford, CA; 1971.
10. Martin G. Mémoire de Mâtrise. Mémoire de Mâtrise. 1991;Université Laval, Québec, Canada.
11. Van der Vorst H.A. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J Sci Stat Comput. 13:1992;631-644.
12. Saad Y. A flexible inner-outer preconditioned GMRES algorithm. SIAM J Sci Stat Comput. 14:1993;461-469.
13. Saad Y. Iterative methods for sparse linear systems. 1996;PWS Publishing Company, Boston.
14. Chan T.F., Gallopoulos E., Simoncini V., Szeto T., Tong C.H. A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems. SIAM J Sci Comput. 15:(2):1994;338-347.
15. Duff I.S., Grimes R.G., Lewis J.G. Sparse matrix test problems. ACM Trans Math Software. 15:1989;1-14.
16. Gould N.I.M., Scott J.A. Sparse approximate-inverse preconditioners using norm minimization techniques. SIAM J Sci Comput. 19:(2):1998;605-625.
17. Tang W.-P. Toward an effective sparse approximate inverse preconditioner. SIAM J Matrix Anal Appl. 20:(4):1999;970-986.
18. Huckle T.K. Efficient computation of sparse approximate inverses. Numer Lin Alg Appl. 5:1998;57-71.
19. Chow E. A priori sparsity patterns for parallel sparse approximate inverse preconditioners. SIAM J Sci Comput. 21:(5):2000;1804-1822.
20. Carpentieri B., Duff I.S., Giraud L. Sparsity pattern selection strategies for robust Frobenius-norm minimization preconditioners in electromagnetism. Numer Lin Alg Appl. 7:2000;667-685.
21. Almeida P. Direct solution of sparse systems by graphs. PhD Thesis. Department of Mathematics, University of Las Palmas de Gran Canaria, Las Palmas, Spain; 1990 (in Spanish).
22. Cuthill E.H., Mckee J.M. Proceedings of the 24th National Conference of the Association for Computing Machinery. Proceedings of the 24th National Conference of the Association for Computing Machinery. 1969;Brondon Press, New Jersey. p. 157-72.
23. George A., Liu J.W. An implementation of a pseudo-peripheral node finder. ACM Trans Math Software. 5:1979;284-295.
24. Kelley C.T. Frontiers in applied mathematics. Frontiers in applied mathematics. 1995;SIAM, Philadelphia.
25. Horn R.A., Johnson C.R. Topics in matrix analysis. 1999;Cambridge University Press, Cambridge.
26. Sonneveld P. CGS: a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J Sci Stat Comput. 10:1989;36-52.
27. Suárez Sarmiento AF. Contribution to biorthogonalization algorithms for the solution of linear equations. PhD Thesis. Department of Mathematics, University of Las Palmas de Gran Canaria, Las Palmas, Spain; 1995 (in Spanish).
28. Montero G., Suárez A. Left-right preconditioning versions of BCG-like methods. Neural Parallel Sci Comput. 3:(4):1995;487-502.
29. Lewis R.R. Simulated annealing for profile and fill reduction of sparse matrices. Int J Numer Meth Engng. 37:1994;905-925.
30. Montero G., Galán M., Cuesta P., Winter G. Effects of stochastic ordering on preconditioned GMRES algorithm. Topping B.H.V., Papadrakakis M. Advances in structural optimization. Proceedings of the Computational Structures Technology. 1994;241-246 Civil-Comp Press, Edinburgh.