A two-level sparse approximate inverse preconditioner for unsymmetric matrices

IMA Journal of Numerical Analysis

Volumn 26, Issue 1 SPEC. ISS., 2006, Pages 11-24

  Chen, Ke ^a   Hughes, Martyn D ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Gauss Jordan decomposition; Iterative solution; Sparse approximate inverses; Two level preconditioners; Unsymmetric systems

Indexed keywords

BENCHMARKING; INVERSE PROBLEMS; ITERATIVE METHODS; LINEAR SYSTEMS; NUMERICAL METHODS;

ITERATIVE SOLUTIONS; JORDAN DECOMPOSITION; NUMERICAL EXPERIMENTS; PRECONDITIONERS; SPARSE APPROXIMATE INVERSE; SPARSE APPROXIMATIONS; TWO-LEVEL PRECONDITIONING; UNSYMMETRIC MATRICES;

MATRIX ALGEBRA;

EID: 30444439870     PISSN: 02724979     EISSN: 14643642     Source Type: Journal    
DOI: 10.1093/imanum/dri031     Document Type: Article

References (57)

1. AXELSSON, O. (1994) Iterative Solution Methods. Cambridge, UK: Cambridge University Press.
2. BARRETT, R., BERRY, M., CHAN, T. F., DEMMEL, J., DONATO, J., DONGARRA, J., EIJKHOUT, V., POZO, R., ROMINE, C. & VAN DER VORST, H. (1994) Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd edn. Philadelphia, PA: SIAM.
3. BARULLI, M. & EVANS, D. J. (1996) Implicit Gauss-Jordan scheme for the solution of linear systems. Parallel Algorithm Appl., 10, 145-159.
4. BENSON, M. W. & FREDERICKSON, P. O. (1982) Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems. Utilitas Math., 22, 127-140.
5. BENZI, M., HAWS, J. C. & TUMA, M. (2000) Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Sci. Comput., 22, 1333-1353.
6. BENZI, M. & TUMA, M. A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math., 30, 305-340.
7. BENZI, M. & TUMA, M. (1998) A sparse approximate inverse preconditioner for nonsymmetric linear systems. SIAM J. Sci. Comput., 19, 968-994.
8. BJORCK, A. (1996) Numerical Methods for Least Squares Methods. Philadelphia, PA: SIAM Publications.
9. BOLLHÖFER, M. & SAAD, Y. (2004) Multilevel preconditioners constructed from inverse-based ILUs. UMSI report 2004/75. Minnesota, MN: University of Minnesota.
10. BRIDSON, R. & TANG, W. P. (2001) Multiresolution approximate inverse preconditioners. SIAM J. Sci. Comput., 23, 463-479.
11. CARPENTIERI, B., DUFF, I. S. & GIRAUD, L. (2000a) Experiments with sparse preconditioners of dense problems from electromagnetic applications. CERFACS TR/PA/00/04, France; http://www.cerfacs.fr/algor/reports/2000/TR_PA_00.04.ps.gz.
12. CARPENTIERI, B., DUFF, I. S. & GIRAUD, L. (2000b) Some sparse pattern selection strategies for robust Frobenius norm minimization preconditioners in electromagnetism. Numer. Linear Algebra Appl., 7, 667-685.
13. (See also RAL-TR-2000-009, http://www.numerical.rl.ac.uk/reports.)
14. CARPENTIERI, B., DUFF, I. S. & GIRAUD, L. (2003) A class of spectral two-level preconditioners. SIAM J. Sci. Comput., 25, 749-765.
15. (See also CERFACS TR/PA/02/55. France, http://www.cerfacs.fr/algor/reports/2002/TR_PA_02_55.ps.gz)
16. CHAN, T. F. & CHEN, K. (2002) On two variants of an algebraic wavelet preconditioner. SIAM J. Sci. Comput., 24, 260-283.
17. (See also UCLA CAM report 02-02.)
18. CHAN, T. F., TANG, W. P. & WAN, W. L. (1997) Wavelet sparse approximate inverse preconditioners. BIT, 37, 644-660.
19. CHEN, K. (1998) On a class of preconditioning methods for dense linear systems from boundary elements. SIAM J. Sci. Comput., 20, 684-698.
20. CHEN, K. (2001) An analysis of sparse approximate inverse preconditioners for boundary integral equations. SIAM J. Matrix Anal. Appl., 22, 1058-1078.
21. CHEN, K. (2005) Matrix Preconditioning Techniques and Applications. Cambridge, UK: Cambridge University Press.
22. CHEN, K. & HARRIS, P. J. (2001) Iterative methods for solving the boundary element equations for the three dimensional Helmholtz equation. Appl. Numer. Math., 36, 475-489.
23. CHEN, K. & LAI, C. H. (2002) Parallel algorithms of the Purcell method for direct solution of linear systems. Parallel Comput., 28, 1275-1291.
24. CHOW, E. (2000) A priori sparsity patterns for parallel sparse inverse preconditioners. SIAM J. Sci. Comput., 21, 1804-1822.
25. CHOW, E. (2001) Parallel implementation and practical use of sparse approximate inverse preconditioners with a priori sparsity patterns. Int. J. High Perf. Comput. Appl., 15, 56-74.
26. CHOW, E. & SAAD, Y. (1997) Parallel approximate inverse preconditioners. Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing. Minneapolis, MN, pp. 14-17.
27. (See also http://www.llnl.gov/CASC/people/chow/pubs/history.ps.)
28. CHOW, E. & SAAD, Y. (1998) Approximate inverse preconditioners via sparse-sparse iterations. SIAM J. Sci. Comput., 19, 995-1023.
29. COHEN, A. & MASSON, R. (1999) Wavelet methods for second-order elliptic problems, preconditioning, and adaptivity. SIAM. J. Sci. Comput., 21, 1006-1026.
30. COSGROVE, J. D. F., DIAZ, J. C. & GRIEWANK, A. (1992) Approximate inverse preconditioners for sparse linear systems. Int. J. Comput. Math., 44, 91-110.
31. DEMKO, S., MOSS, W. F. & SMITH, P. W. (1984) Decay rates for inverse of band matrices. Math. Comput., 43, 491-499.
32. DUFF, I. S. & KOSTER, J. (1999) The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20, 889-901.
33. (See also RAL-TR-1999-030, http://www.numerical.rl.ac.uk/reports/.)
34. EMBREE, M. (1999) How descriptive are GMRES convergence bounds? NA Report 99/08. University of Oxford Computing Laboratory; http://web.comlab.ox.ac.uk/oucl/publications/natr/na-99-08.html.
35. FOX, L. (1964) An Introduction to Numerical Linear Algebra. Oxford, UK: Oxford University Press.
36. FREUND, R. W., GOLUB, G. H. & NACHTIGAL, N. M. (1992) Iterative Solution of Linear Systems, Acta Numerica. Cambridge, UK: Cambridge University Press, pp. 57-100.
37. GOLUB, G. H. & VAN LOAN, C. (1989) Matrix Computation, 2nd edn. Baltimore and London, USA: John Hopkins University Press.
38. GOULD, N. I. M. & SCOTT, J. A. (1998) Sparse approximate-inverse preconditioners using norm-minimization techniques. SIAM J. Sci. Comput., 19, 605-625.
39. (See also RAL-TR-1995-026, http://www.numerical.rl.ac.uk/reports/.)
40. GROSZ, L. (2000) Preconditioning by incomplete block elimination. Numer. Linear Algebra Appl., 7, 527-541.
41. GROTE, M. & HUCKLE, T. (1997) Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput., 18, 838-853.
42. HUCKLE, T. (1999) Approximate sparsity patterns for the inverse of a matrix and preconditioning. Appl. Numer. Math., 30, 291-303.
43. ISAACSON, E. & KELLER, H. B. (1966) Analysis of Numerical Methods. New York: John Wiley.
44. KAPORIN, I. E. (1992) Two-level explicit preconditioning of the conjugate gradient method. Differ. Equ., 28, 329-339.
45. KOLOTILINA, L. Y., NIKISHIN, A. A. & YEREMIN, A. Y. (1999) Factorized sparse approximate inverse preconditioners IV: simple approaches to rising efficiency. Numer. Linear Algebra Appl., 6, 515-531.
46. KOLOTILINA, L. Y. & YEREMIN, A. Y. (1986) On a family of two-level preconditionings of the incomplete block factorization type. Sov. J. Numer. Anal. Math. Model., 1, 293-320.
47. KOLOTILINA, L. Y. & YEREMIN, A. Y. (1993) Factorized sparse approximate inverse preconditioners I - theory. SIAM J. Matrix Anal. Appl., 14, 45-58.
48. KOSCHINSKI, C. (1999) Properties of approximate inverse and adaptive control concepts for preconditioning. Internal Report 74/99, PhD Thesis, University of Karlsrule, Germany (www.ubka.uni-karlsruhe.de/indexer-vvv/1999/mathematik/4).
49. NACHTIGAL, N. M., REDDY, S. & TREFETHEN, N. (1992) How fast are nonsymmetric matrix iterations'? SIAM J. Matrix Anal. Appl., 13, 778-795.
50. SAAD, Y. (1996) Iterative Methods for Sparse Linear Systems. Boston: PWS Publishing.
51. SAAD, Y. & SCHULTZ, M. H. (1986) GMRES: a generalized minimal residual algorithm for solving unsymmetric linear systems. SIAM J. Sci. Stat. Camput., 7, 856-869.
52. SAAD, Y. & VAN DER VORST, H. A. (2000) Iterative solution of linear systems in the 20th century. J. Comput. Appl. Math., 123, 1-33.
53. TANG, W. P. (1999) Towards an effective sparse approximate inverse preconditioner. SIAM J. Matrix Anal. Appl., 20, 970-986.
54. TANG, W. P. & WAN, W. L. (2000) Sparse approximate inverse smoother for multigrid. SIAM J. Matrix Anal. Appl., 21, 1236-1252.
55. VAN DER VORST, H. A. (1992) BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput., 13, 631-644.
56. VAVASIS, S. (1992) Preconditioning for boundary integral equations. SIAM J. Matrix Anal. Appl., 13, 905-925.
57. ZOLLENKOPF, K. (1971) Bi-factorisation - basic computational algorithm and programming technique. Large Sparse Sets of Linear Equations (J. K. Reid ed.). New York: Academic Press, pp. 75-97.