Metraipolis › archive › dc_d6984a7170dd

Stochastic trace estimation for positive trace-class operators — arXiv:2608.28135

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28135
License (as archived)
CC0-1.0
Archived
2026-10-17T11:22:24.075Z
SHA-256 of the archived text
8a638138bbb10bfbf2bfe83d825d62f3e0eac1b18c1fdb79041133d3aabf0626
Stable URL of this page
https://metraipolis.com/documento/dc_d6984a7170dd

How to cite

Stochastic trace estimation for positive trace-class operators — arXiv:2608.28135 — arXiv (en), https://arxiv.org/abs/2608.28135 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d6984a7170dd (Metraipolis archive dc_d6984a7170dd, sha256 8a638138bbb10bfbf2bfe83d825d62f3e0eac1b18c1fdb79041133d3aabf0626)
BibTeX
@misc{dcd6984a7170dd,
  title = {Stochastic trace estimation for positive trace-class operators — arXiv:2608.28135},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28135},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d6984a7170dd; sha256 8a638138bbb10bfbf2bfe83d825d62f3e0eac1b18c1fdb79041133d3aabf0626},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28135. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Implicit trace estimation aims to approximate the trace of a matrix or linear operator accessible only through matrix-vector or operator-vector products. In the matrix setting, the Girard-Hutchinson estimator typically requires $\mathcal{O}(\varepsilon^{-2})$ products to achieve accuracy $\varepsilon$, while the variance-reduced Hutch++ algorithm reduces this sample complexity to $\mathcal{O}(\varepsilon^{-1})$ for positive semidefinite matrices. We develop infinite-dimensional analogues of these estimators for positive trace-class operators on separable Hilbert spaces. The idealized estimators use Gaussian random elements whose covariance is determined by the target operator, leading to unbiased operator versions of Girard-Hutchinson and Hutch++. We prove high-probability error bounds analogous to the finite-dimensional matrix results; in particular, idealized infHutch++ achieves $\mathcal{O}(\varepsilon^{-1})$ sample complexity. For practical computation, we introduce truncated implementations that restrict the random samples to finite-dimensional subspaces; for fixed sample budget, we show that truncated infHutch++ converges in distribution to its idealized counterpart as the truncation dimension tends to infinity. Numerical experiments with integral operators, density-of-states approximations, and spectral filtering for a radial Dirac operator show that these truncated estimators can achieve accuracy comparable to the ContHutch++ algorithm by Zvonek, Horning & Townsend while using lower-degree function representations and smaller internal discretizations in chebfun.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2608.28135 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T11:06:05.074Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).