Fast construction of hierarchical matrix representation from matrix-vector multiplication

Journal of Computational Physics

Volumn 230, Issue 10, 2011, Pages 4071-4087

  Lin, Lin ^a   Lu, Jianfeng ^b   Ying, Lexing ^c  

^a PRINCETON UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Elliptic operator; Fast algorithm; Green's function; Hierarchical matrix construction; Matrix vector multiplication; Randomized singular value decomposition

Indexed keywords

VECTORS;

CONSTRUCTION ALGORITHMS; ELLIPTIC OPERATOR; FAST ALGORITHMS; GREENS FUNCTION; HIERARCHICAL MATRIX; HIERARCHICAL MATRIX CONSTRUCTION; MATRIX REPRESENTATION; MATRIX VECTOR MULTIPLICATION; RANDOMIZED SINGULAR VALUE DECOMPOSITION;

SINGULAR VALUE DECOMPOSITION;

EID: 79952901900     PISSN: 00219991     EISSN: 10902716     Source Type: Journal    
DOI: 10.1016/j.jcp.2011.02.033     Document Type: Article

References (30)

1. S. Börm, L. Grasedyck, W. Hackbusch, Hierarchical matrices, max-Planck-Institute Lecture Notes, 2006.
2. Hackbusch W. A sparse matrix arithmetic based on H-matrices. Part I: Introduction to H-matrices. Computing 1999, 62:89-108.
3. Hackbusch W., Khoromskij B., Sauter S.A. On H2-matrices. Lectures on Applied Mathematics (Munich, 1999) 2000, 9-29. Springer, Berlin.
4. Bebendorf M., Hackbusch W. Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L∞-coefficients. Numer. Math. 2003, 95:1-28.
5. Engquist B., Runborg O. Wavelet-based numerical homogenization with applications. Lect. Notes Comput. Sci. Eng. 2002, vol. 20:97-148. Springer, Berlin.
6. N. Halko, P. Martinsson, J. Tropp, Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions, preprint, 2009. Available from: arxiv:0909.4061.
7. Liberty E., Woolfe F., Martinsson P., Rokhlin V., Tygert M. Randomized algorithms for the low-rank approximation of matrices. Proc. Natl. Acad. Sci. USA 2007, 104:20167-20172.
8. Woolfe F., Liberty E., Rokhlin V., Tygert M. A fast randomized algorithm for the approximation of matrices. Appl. Comput. Harmon. Anal. 2008, 25:335-366.
9. Golub G., Van Loan C. Matrix Computations 1996, Johns Hopkins Univ. Press, Baltimore. third ed.
10. Greengard L., Rokhlin V. A fast algorithm for particle simulations. J. Comput. Phys. 1987, 73:325-348.
11. Chandrasekaran S., Gu M., Lyons W. A fast adaptive solver for hierarchically semiseparable representations. Calcolo 2005, 42(3-4):171-185.
12. Chandrasekaran S., Gu M., Pals T. A fast ULV decomposition solver for hierarchically semiseparable representations. SIAM J. Matrix Anal. Appl. 2006, 28(3):603-622.
13. Duff J., Reid J. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 1983, 9:302-325.
14. George J. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 1973, 10:345-363.
15. Brandt A. Multi-level adaptive solutions to boundary-value problems. Math. Comput. 1977, 31:333-390.
16. Briggs W., Henson V.E., McCormick S.F. A Multigrid Tutorial. Society for Industrial and Applied Mathematics 2000, SIAM, Philadelphia. second ed.
17. Brandt A., McCormick S., Ruge J. Algebraic multigrid (AMG) for sparse matrix equations. Sparsity and Its Applications 1985, 257-284. Cambridge Univ. Press, Cambridge.
18. Smith B.F., Bjørstad P.E., Gropp W.D. Domain Decomposition 1996, Cambridge Univ. Press, Cambridge.
19. Toselli A., Widlund O. Domain Decomposition Methods - Algorithms and Theory. Springer Series in Computational Mathematics 2005, vol. 34. Springer Verlag, Berlin.
20. Beylkin G., Coifman R., Rokhlin V. Fast wavelet transforms and numerical algorithms I. Commun. Pure Appl. Math 1991, 44(2):141-183.
21. Benzi M., Meyer C., Tuma M. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 1996, 17:1135-1149.
22. S. Chandrasekaran, M. Gu, X.S. Li, J. Xia, Superfast multifrontal method for structured linear systems of equations, Technical Report, LBNL-62897, 2006.
23. Martinsson P. A fast direct solver for a class of elliptic partial differential equations. J. Sci. Comput. 2009, 38:316-330.
24. Hackbusch W., Nowak Z.P. On the fast matrix multiplication in the boundary element method by panel clustering. Numer. Math. 1989, 54:463-491.
25. Drineas P., Kannan R., Mahoney M.W. Fast Monte Carlo algorithms for matrices. II: Computing a low-rank approximation to a matrix. SIAM J. Comput. 2006, 36(1):158-183.
26. Drineas P., Kannan R., Mahoney M.W. Fast Monte Carlo algorithms for matrices. III: Computing a compressed approximate matrix decomposition. SIAM J. Comput. 2006, 36(1):184-206.
27. Goreinov S., Tyrtyshnikov E., Zamarashkin N. A theory of pseudoskeleton approximations. Linear Algebra Appl. 1997, 261:1-21.
28. Mahoney M., Drineas P. CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. USA 2009, 106:697-702.
29. P. Martinsson, Rapid factorization of structured matrices via randomized sampling, preprint, 2008. Available from: arxiv:0806.2339.
30. Owhadi H., Zhang L. Metric-based upscaling. Commun. Pure Appl. Math. 2007, 60:675-723.