Data-sparse approximation of non-local operators by \(\mathcal H^2\)-matrices (Q874989)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Data-sparse approximation of non-local operators by H^2-matrices |
scientific article; zbMATH DE number 5141621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Data-sparse approximation of non-local operators by \(\mathcal H^2\)-matrices |
scientific article; zbMATH DE number 5141621 |
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
0.8780584931373596
0 references
0.8780584931373596
0 references
0.8726844191551208
0 references
0.8593098521232605
0 references
