Quasi-Optimal Randomized Recovery of $\mathcal{H}^2$ Matrices (Q7367865)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-Optimal Randomized Recovery of $\mathcal{H}^2$ Matrices |
No description defined |
Statements
Quasi-Optimal Randomized Recovery of $\mathcal{H}^2$ Matrices (English)
0 references
3 October 2026
0 references
math.NA
0 references
Anna Yesypenko
0 references
We propose randomized algorithms for efficient approximate reconstruction of $\mathcal{H}^2$ matrices from products with the matrix and its adjoint, leveraging adaptive geometric hierarchies; carried recovery requires $O(k+p)$ applications, independent of tree depth.
0 references
Randomized Recovery
0 references
Approximation Algorithms
0 references
H2 Matrices
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
