Data-sparse approximation of non-local operators by H2-matrices

Linear Algebra and Its Applications

Volumn 422, Issue 2-3, 2007, Pages 380-403

  Börm, Steffen ^a  

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

Author keywords

Data sparse approximation; Hierarchical matrices; Nested bases

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; WAVELET TRANSFORMS;

DATA-SPARSE APPROXIMATION; HIERARCHICAL MATRICES; NESTED BASES;

MATHEMATICAL OPERATORS;

EID: 33847264563     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.10.021     Document Type: Article

References (23)

1. ∞-coefficients. Numer. Math. 95 (2003) 1-28
2. 2-matrices-multilevel methods for the approximation of integral operators. Comput. Visual. Sci. 7 (2004) 173-181
3. 2-matrices with adaptive bases. Computing 74 (2005) 249-271
4. 2-matrix arithmetics in linear complexity. Computing 77 (2006) 1-28
5. Börm S., and Grasedyck L. Hybrid cross approximation of integral operators. Numer. Math. 101 (2005) 221-249
6. S. Börm, L. Grasedyck, W. Hackbusch, in: Hierarchical Matrices, Lecture Note 21 of the Max Planck Institute for Mathematics in the Sciences, 2003.
7. 2-matrices. Computing 69 (2002) 1-35
8. 2-matrix approximation of integral operators by interpolation. Appl. Numer. Math. 43 (2002) 129-143
9. Börm S., Löhndorf M., and Melenk J.M. Approximation of integral operators by variable-order interpolation. Numer. Math. 99 (2005) 605-643
10. Börm S., and Sauter S.A. BEM with linear complexity for the classical boundary integral operators. Math. Comp. 74 (2005) 1139-1177
11. Giebermann K. Multilevel approximation of boundary integral operators. Computing 67 (2001) 183-207
12. Golub G.H., and Van Loan C.F. Matrix Computations (1984), Wiley-Interscience, New York
13. L. Grasedyck, Theorie und Anwendungen Hierarchischer Matrizen, doctoral thesis, Universität Kiel, 2001.
14. 2-matrices. Computing 70 (2003) 295-334
15. Greengard L., and Rokhlin V. A fast algorithm for particle simulations. J. Comput. Phys. 73 (1987) 325-348
16. Greengard L., and Rokhlin V. A new version of the fast multipole method for the Laplace in three dimensions. Acta Numerica (1997), Cambridge University Press 229-269
17. Hackbusch W. A sparse matrix arithmetic based on H-matrices. Part I: Introduction to H-matrices. Computing 62 (1999) 89-108
18. Hackbusch W., and Khoromskij B. A sparse matrix arithmetic based on H-matrices. Part II: Application to multi-dimensional problems. Computing 64 (2000) 21-47
19. 2-matrices. In: Bungartz H., Hoppe R., and Zenger C. (Eds). Lectures on Applied Mathematics (2000), Springer-Verlag, Berlin 9-29
20. Hackbusch W., and Nowak Z.P. On the fast matrix multiplication in the boundary element method by panel clustering. Numer. Math. 54 (1989) 463-491
21. Rokhlin V. Rapid solution of integral equations of classical potential theory. J. Comput. Phys. 60 (1985) 187-207
22. S.A. Sauter, Variable order panel clustering (extended version), Preprint 52/1999, Max-Planck-Institut für Mathematik, Leipzig, Germany, 1999.
23. Sauter S.A. Variable order panel clustering. Computing 64 (2000) 223-261