Metraipolis › archive › dc_652e38f48d68
Constructive Tchakaloff results and well-conditioned quadrature through randomized least squares — arXiv:2609.09506
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.09506
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:13:16.459Z
- SHA-256 of the archived text
f89976132a476eb6a0badf7311ac616153fca08fe709ec3d60da949e231304e9- Stable URL of this page
https://metraipolis.com/documento/dc_652e38f48d68
How to cite
Constructive Tchakaloff results and well-conditioned quadrature through randomized least squares — arXiv:2609.09506 — arXiv (en), https://arxiv.org/abs/2609.09506 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_652e38f48d68 (Metraipolis archive dc_652e38f48d68, sha256 f89976132a476eb6a0badf7311ac616153fca08fe709ec3d60da949e231304e9)
BibTeX
@misc{dc652e38f48d68,
title = {Constructive Tchakaloff results and well-conditioned quadrature through randomized least squares — arXiv:2609.09506},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.09506},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_652e38f48d68; sha256 f89976132a476eb6a0badf7311ac616153fca08fe709ec3d60da949e231304e9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09506. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider using randomized least squares to construct quadrature rules exact on a subspace of functions. Using new conditions that we call relative admissibility and reference weight concentration, we establish both that the quadrature weights from such a procedure concentrate close to their asymptotic values with prescribed and arbitrarily large probability, and this in turn provides useful finite-sample probabilistic bounds on the stability of the resulting quadrature rules for very general classes of possibly complex-valued functions. Our analysis both significantly generalizes the existing analysis of randomized least squares quadrature construction, and provides new bounds on stability for these rules. These results specialize to existence results for positive quadrature rules, when such rules can be theoretically expected. Because our procedures are formally algorithmic, our analysis is a substantive advance toward computationally constructive generalized Tchakaloff theorems. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.09506 — 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-16T08:46:35.694Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).