arXiv (All)
open access
Quasi-Optimal Randomized Recovery of $\mathcal{H}^2$ Matrices
An $\mathcal H^2$ matrix represents well-separated interactions using nested low-rank bases while retaining nearby interactions explicitly. We consider the problem of constructing an explicit, strongly admissible $\mathcal H^2$ approximation using only products with the matrix and its adjoint, and d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Convergence of Stochastic Low-Rank Adaptation#1116380
- Matrices perturbed by random noise: The accuracy of low-rank approximation#652125
- Matrices perturbed by random noise: The accuracy of low-rank approximation#650672
- $p$-robust equivalence of global continuous constrained and local discontinuous unconstrained approximation, a $p$-stable local commuting projector, and optimal elementwise $hp$ approximation estimates in ${\boldsymbol H}(\mathrm{div})$#268782
- Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising#347910
Record · ID 1200225
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive