On exact discretization of the $L_2$-norm with a negative weight
I.V. Limonova

TL;DR
This paper investigates the minimal number of points needed for exact discretization of the $L_2$-norm in a function subspace, demonstrating the necessity of negative weights in some cases.
Contribution
It constructs a subspace where any exact discretization requires at least one negative weight, highlighting limitations of positive-weight discretizations.
Findings
Existence of subspaces requiring negative weights for exact discretization
Lower bounds on the number of nodes for discretization
Implications for numerical integration and approximation theory
Abstract
For a subspace of functions from we consider the minimal number of nodes necessary for the exact discretization of the -norm of the functions in . We construct a subspace such that for any exact discretization with nodes there is at least one negative weight.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Mathematical Approximation and Integration · Advanced Numerical Analysis Techniques
