Backend
Random nodes with positive weights: Richter-Tchakaloff rules and optimal positive quadrature
arXiv cs.NA0 views
arXiv:2610.32699v1 Announce Type: new Abstract: We show that independent random points support exact quadrature rules with positive weights. For any $n$-dimensional space $V$ of integrable functions a constant multiple of $n\log n$ points sampled from a suitable density yields, with high probability, positive weights which integrate the functions in the space exactly. The weights stay close to the natural importance sampling weights according to the Lewis density with respect to $V$. They are the result of a weight adaptation procedure which requires an explicit $L_1$-norm discretization result that is proved on the way. As an application, we study numerical integration in reproducing kernel Hilbert spaces. Combining the random rules with a subsampling step, we show that positive quadrature rules with constantly oversampled nodes achieve the best possible worst-case error bound in terms of the singular numbers of the embedding into $L_2$.
Source:https://arxiv.org/abs/2610.32699PreviousUniversal neural network approximation of symmetric polyconvex energies and envelopesNextNeural network enhancement of the Born approximation
Related posts
Ask HN: Who is hiring? (November 2026)
0Hacker News Ask

Is there a nicer syntax for `if let ... Some(destructred_field) else None`?
0Rust Users Forum
Convert YAML to JSON in the Browser (and JSON to YAML) Without Uploading the File
0dev.to
Vercel agent-desktop: computer use for coding agents through the accessibility tree
0dev.to
WARN Act and Job Search — How to Use the 60-Day Notice Period to Find Your Next Job
0dev.to
Node.js SMS Verification Code: Generating and Sending One-Time Passwords via API Integration
0dev.to