Stable high-order cubature formulas for experimental data
From MaRDI portal
Publication:2133503
DOI10.1016/j.jcp.2021.110693OpenAlexW3084175674WikidataQ113871697 ScholiaQ113871697MaRDI QIDQ2133503
Publication date: 29 April 2022
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.03452
numerical integrationleast squaresexperimental datadiscrete orthogonal polynomials\(\ell^1\) minimizationstable high-order cubature
Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Communication, information (94Axx) Approximations and expansions (41Axx)
Related Items (5)
Summation-by-Parts Operators for General Function Spaces ⋮ Constrained mock-Chebyshev least squares quadrature ⋮ Multi-dimensional summation-by-parts operators for general function spaces: theory and construction ⋮ Stabilizing discontinuous Galerkin methods using Dafermos' entropy rate criterion. I: One-dimensional conservation laws ⋮ Towards stability results for global radial basis function based quadrature formulas
Uses Software
Cites Work
- Non-intrusive uncertainty quantification using reduced cubature rules
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- A method for numerical integration on an automatic computer
- Funktionen von beschränkter Variation in der Theorie der Gleichverteilung
- Adaptive sampling-based quadrature rules for efficient Bayesian prediction
- Extensions of Gauss quadrature via linear programming
- Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
- An encyclopaedia of cubature formulas.
- Generalized inverses. Theory and applications.
- Generation and application of multivariate polynomial quadrature rules
- Approximate integrals over the volume of the ball
- Stable high-order quadrature rules with equidistant points
- Stable discretisations of high-order discontinuous Galerkin methods on equidistant and scattered points
- An Algorithm for Computing Fekete Points in the Triangle
- Atomic Decomposition by Basis Pursuit
- How to Integrate a Polynomial over a Sphere
- Numerical Integration in Multiple Dimensions with Designed Quadrature
- Book Review: A mathematical introduction to compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- $l_2 $-Solutions to Underdetermined Linear Systems
- Effectively Subsampled Quadratures for Least Squares Polynomial Approximations
- Advanced Linear Algebra
- Generating Nested Quadrature Rules with Positive Weights based on Arbitrary Sample Sets
- Exactness of Quadrature Formulas
- Shock capturing and high-order methods for hyperbolic conservation laws
- Stable High Order Quadrature Rules for Scattered Data and General Weight Functions
- Cubature, Approximation, and Isotropy in the Hypercube
- Multivariate polynomial approximation in the hypercube
- Caratheodory-Tchakaloff Subsampling
- High Order Edge Sensors with $\ell^1$ Regularization for Enhanced Discontinuous Galerkin Methods
- High-dimensional integration: The quasi-Monte Carlo way
- A Cardinal Function Algorithm for Computing Multivariate Quadrature Points
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Stable signal recovery from incomplete and inaccurate measurements
- A General Algorithm for Nonnegative Quadrature Formulas
- A Construction of Nonnegative Approximate Quadratures
- Necessary and Sufficient Conditions for Equidistant Quadrature Formula
- Numerical Evaluation of Multiple Integrals
- Discrete Least Squares and Quadrature Formulas
- The Monte Carlo Method
- Best Approximate Integration Formulas; Best Approximation Formulas
- Compressed sensing
- Linear programming. Foundations and extensions
- Cubature formulae and orthogonal polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stable high-order cubature formulas for experimental data
