Construction of data-sparse ℋ2-Matrices by hierarchical compression

SIAM Journal on Scientific Computing

Volumn 31, Issue 3, 2009, Pages 1820-1839

  Börm, Steffen ^a  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

Author keywords

Data sparse approximation; Hierarchical matrices; Nonlocal operators

Indexed keywords

APPROXIMATION ALGORITHMS; DIGITAL STORAGE;

DATA-SPARSE APPROXIMATIONS; HIERARCHICAL COMPRESSION; HIERARCHICAL MATRIX; MATRIX; MATRIX ALGORITHMS; MATRIX EQUATIONS; MATRIX FUNCTIONS; NEW APPROACHES; NONLOCAL OPERATOR; STORAGE REQUIREMENTS;

MATRIX ALGEBRA;

EID: 61849133507     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/080720693     Document Type: Article

References (25)

1. ∞-coefficients, Numer. Math., 95 (2003), pp. 1-28.
2. M. BEBENDORF AND S. RJASANOW, Adaptive low-rank approximation of collocation matrices, Computing, 70 (2003), pp. 1-24.
3. 2-matrices with adaptive bases, Computing, 74 (2005), pp. 249-271.
4. S. BÖRM, Adaptive variable-rank approximation of dense matrices, SIAM J. Sci. Comput., 30 (2007), pp. 148-168.
5. 2-matrices, Technical report 85, Max Planck Institute for Mathematics in the Sciences, Leipzig, 2007.
6. 2-matrices, Linear Algebra Appl., 422 (2007), pp. 380-403.
7. S. BÖRM AND L. GRASEDYCK, Hybrid cross approximation of integral operators, Numer. Math., 101 (2005), pp. 221-249.
8. S. BÖRM, L. GRASEDYCK, AND W. HACKBUSCH, Hierarchical Matrices, Lecture Note 21 of the Max Planck Institute for Mathematics in the Sciences, 2003.
9. 2-matrices, Computing, 69 (2002), pp. 1-35.
10. P. G. CIARLET, The Finite Element Method for Elliptic Problems, SIAM, Philadelphia, 2002.
11. I. GAVRILYUK, W. HACKBUSCH, AND B. N. KHOROMSKU, ℋ-matrix approximation for the operator exponential with applications, Numer. Math., 92 (2002), pp. 83-111.
12. I. GAVRILYUK, W. HACKBUSCH, AND B. N. KHOROMSKU, Data-sparse approximation to operator-valued functions of elliptic operator, Math. Comput., 73 (2004), pp. 1107-1138.
13. L. GRASEDYCK, Theorie und Anwendungen Hierarchischer Matrizen, Doctoral thesis, Universität Kiel, 2001.
14. L. GRASEDYCK, Adaptive recompression of ℋ-matrices for BEM, Computing, 74 (2004), pp. 205-223.
15. L. GRASEDYCK, Existence of a low-rank or ℋ-matrix approximant to the solution of a Sylvester equation, Numer. Linear Algebra Appl., 11 (2004), pp. 371-389.
16. L. GRASEDYCK AND W. HACKBUSCH, Construction and arithmetics of ℋ-matrices, Computing, 70 (2003), pp. 295-334.
17. L. GRASEDYCK, W. HACKBUSCH, AND B. N. KHOROMSKU, Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices, Computing, 70 (2003), pp. 121-165.
18. L. GREENGARD AND V. ROKHLIN, A fast algorithm for particle simulations, J. Comput. Phys., 73 (1987), pp. 325-348.
19. W. HACKBUSCH, A sparse matrix arithmetic based on ℋ-matrices. Part I: Introduction to ℋ- matrices, Computing, 62 (1999), pp. 89-108.
20. W. HACKBUSCH AND B. N. KHOROMSKU, A sparse matrix arithmetic based on ℋ-matrices. Part II: Application to multi-dimensional problems, Computing, 64 (2000), pp. 21-47.
21. 2-matrices, in Lectures on Applied Mathematics, H. Bungartz, R. Hoppe, and C. Zenger, eds., Springer-Verlag, Berlin, 2000, pp. 9-29.
22. W. HACKBUSCH AND Z. P. NOWAK, On the fast matrix multiplication in the boundary element method by panel clustering, Numer. Math., 54 (1989), pp. 463-491.
23. V. ROKHLIN, Rapid solution of integral equations of classical potential theory, J. Comput. Phys., 60 (1985), pp. 187-207.
24. S. A. SAUTER, Variable order panel clustering, Computing, 64 (2000), pp. 223-261.
25. S. A. SAUTER AND C. SCHWAB, Randelementmethoden, Teubner, 2004.