Jump to Content
View Cart
Logged Out Log In
SIAM J. Sci. Comput. 31, pp. 1820-1839 (20 pages)
Construction of Data-Sparse $\mathcal{H}^2$-Matrices by Hierarchical Compression
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookHierarchical matrices ($\mathcal{H}$-matrices) provide an elegant approach to handling large densely populated matrices: The matrix is split into a hierarchy of blocks, and each block is approximated by a low-rank matrix in factorized form. It has been demonstrated that this representation can be used to treat integral and partial differential equations, solve matrix equations from the field of control theory, and evaluate matrix functions efficiently. $\mathcal{H}^2$-matrices use a refined representation that employs a multilevel structure in order to reduce the storage requirements of hierarchical matrices. It has been shown that $\mathcal{H}^2$-matrices can significantly reduce storage requirements for large problems, in particular when combined with modern error control schemes. Until now, all algorithms for constructing an efficient approximation of a general matrix by an $\mathcal{H}^2$-matrix required a representation of the entire original matrix to be kept in storage; therefore the storage requirements of $\mathcal{H}^2$-matrix algorithms could be far larger than those of the final approximation. This paper presents a new approach that allows us to construct an $\mathcal{H}^2$-matrix without storing the entire original matrix. The central idea is to approximate submatrices and combine them by an efficient new algorithm to form approximations of larger matrices until the entire matrix has been treated. Using this new approach, many $\mathcal{H}$-matrix algorithms can be “refitted” easily to compute results in the more efficient representation. Possible applications include efficient matrix arithmetics for the construction of preconditioners, the approximation of matrix functions or solutions of matrix equations, or efficient compression schemes based on the popular cross approximation algorithms.
© 2009 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received April 08, 2008
Accepted December 02, 2008
Published online February 27, 2009
Accepted December 02, 2008
Published online February 27, 2009
Permalink
For access to fully linked references, you need to log in.
For access to citing articles, you need to log in.
ALL SIAM Content
Scitation
Google Scholar