Data-sparse approximation of non-local operators by \(\mathcal H^2\)-matrices (Q874989): Difference between revisions
From MaRDI portal
Revision as of 16:04, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Data-sparse approximation of non-local operators by \(\mathcal H^2\)-matrices |
scientific article |
Statements
Data-sparse approximation of non-local operators by \(\mathcal H^2\)-matrices (English)
0 references
10 April 2007
0 references
\(\mathcal{H}^{2}\)-matrices employ nested local expansion systems in order to approximate matrices in optimal order of complexity. This paper presents a criterion for the approximability of general matrices in the \(\mathcal{H}^{2}\)-matrix format and an algorithm for finding good nested expansion systems and constructing the approximation efficiently.
0 references
data-sparse approximation
0 references
hierarchical matrices
0 references
nested bases
0 references
\(\mathcal{H}^{2}\)-matrices
0 references
complexity
0 references
0 references
0 references
0 references
