Approximate inverse preconditioning of finite element discretizations of elliptic operators with nonsmooth coefficients

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 4, 2006, Pages 909-929

  Bebendorf, Mario ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Approximate inverse; Hierarchical matrices; Nonsmooth coefficients; Preconditioning

Indexed keywords

APPROXIMATION THEORY; HIERARCHICAL SYSTEMS; INVERSE PROBLEMS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; NUMBER THEORY; ROBUSTNESS (CONTROL SYSTEMS);

APPROXIMATE INVERSE; HIERARCHICAL MATRICES; NONSMOOTH COEFFICIENTS; PRECONDITIONING;

FINITE ELEMENT METHOD;

EID: 33750162350     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/S0895479803437621     Document Type: Conference Paper

References (32)

1. P. R. AMESTOY, I. S. DUFF, J.-Y. L'EXCELLENT, AND J. KOSTER, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 15-41.
2. O. AXELSSON AND G. LINDSKOG, On the rate of convergence of the preconditioned conjugate gradients method, Numer. Math. 48 (1986), pp. 499-523.
3. M. BEBENDORF, Efficient inversion of Galerkin matrices of general second order elliptic differential operators, Math. Comp., 74 (2005), pp. 1179-1199.
4. M. BEBENDORF, Effiziente numerische Lösung von Randintegralgleichungen unter Verwendung von Niedrigrang-Matrizen, Ph.D thesis, Universität Saarbrücken, 2001.
5. M. BEBENDORF, Approximation of boundary element matrices, Numer. Math., 86 (2000), pp. 565-589.
6. M. BEBENDORF AND R. KRIEMANN, Fast Parallel Solution of Boundary Integral Equations and Related Problems, Preprint 10/2004, Max-Planck-Institute MIS, Leipzig, Germany, 2004.
7. M. BEBENDORF AND S. RJASANOW, Adaptive low-rank approximation of collocation matrices, Computing, 70 (2003), pp. 1-24.
8. ∞- coefficients, Numer. Math., 95 (2003), pp. 1-28.
9. M. BENZI, Preconditioning techniques for large linear systems: A survey, J. Comput. Phys., 182 (2002), pp. 418-477.
10. M. BENZI AND M. TŮMA, A sparse approximate inverse preconditioner for nonsyrametric linear systems, SIAM J. Sci. Comput., 19 (1998), pp. 968-994.
11. M. BENZI AND M. TŮMA, A comparative study of sparse approximative inverse preconditioners, Appl. Numer. Math., 30 (1999), pp. 305-340.
12. J. H. BRAMBLE, J. E. PASCIAK, AND J. XU, Parallel multilevel preconditioners, Math. Comp., 55 (1990), pp. 1-22.
13. E. CHOW, A priori sparsity patterns for parallel sparse approximate inverse preconditioners, SIAM J. Sci. Comput., 21 (2000), pp. 1804-1822.
14. E. CHOW AND Y. SAAD, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995-1023.
15. PH. GUILLAUME, A. HUARD, AND C. LE CALVEZ, A block constant approximate inverse for preconditioning large linear systems, SIAM J. Matrix Anal. Appl., 24 (2003), pp. 822-851.
16. L. GRASEDYCK AND W. HACKBUSCH, Construction and arithmetics of ℋ-matrices, Computing, 70 (2003), pp. 295-334.
17. A. GREENBAUM, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997.
18. M. J. GROTE AND T. HUCKLE, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
19. W. HACKBUSCH, A sparse matrix arithmetic based on ℋ-matrices. I. Introduction to ℋ-matrices, Computing, 62 (1999), pp. 89-108.
20. W. HACKBUSCH, Multi-Grid Methods and Applications, Springer, Berlin, 1985.
21. W. HACKBUSCH AND B. N. KHOROMSKIJ, A sparse ℋ-matrix arithmetic: General complexity estimates, J. Comput. Appl. Math., 125 (2000), pp. 479-501
22. W. HACKBUSCH AND B. N. KHOROMSKIJ, A sparse ℋ-matrix arithmetic. II. Application to multi-dimensional problems, Computing, 64 (2000), pp. 21-47.
23. L. YU. KOLOTILINA AND A. YU. YEREMIN, Factorized sparse approximate inverse preconditionings, I. Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
24. L. YU. KOLOTILINA, A. A. NIKISHIN, AND A. YU. YEREMIN, Factorized sparse approximate inverse preconditionings. IV. Simple approaches to rising efficiency, Numer. Linear Algebra Appl. 6 (1999), pp. 515-531.
25. R. KRIEMANN, Parallel ℋ-Matrix Arithmetics on Shared Memory Systems, Preprint 29/2004, Max-Planck-Institute MIS, Leipzig, Germany, 2004.
26. V. ROKHLIN, Rapid solution of integral equations of classical potential theory, J. Comput. Phys., 60 (1985), pp. 187-207.
27. J. W. RUGE AND K. STÜBEN, Algebraic multigrid, in Multigrid Methods, S. F. McCormick, ed., SIAM, Philadelphia, 1987, pp. 73-130.
28. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, 1996.
29. J. SCHÖBERL, NETGEN - An advancing front 2D/3D-mesh generator based on abstract rules, Comput. Vis. Sci., 1 (1997), pp. 41-52.
30. B. F. SMITH, P. E. BJØRSTAD, AND W. D. GROPP, Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations, Cambridge University Press, Cambridge, UK, 1996.
31. E. TYRTYSHNIKOV, Clusters, preconditioners, convergence, Linear Algebra Appl., 263 (1997), pp. 25-48.
32. E. TYRTYSHNIKOV, Mosaic-skeleton approximations, Calcolo, 33 (1996), pp. 47-57.