Caratheodory-Tchakaloff Subsampling
From MaRDI portal
Abstract: We present a brief survey on the compression of discrete measures by Caratheodory-Tchakaloff Subsampling, its implementation by Linear or Quadratic Programming and the application to multivariate polynomial Least Squares. We also give an algorithm that computes the corresponding Caratheodory-Tchakaloff (CATCH) points and weights for polynomial spaces on compact sets and manifolds in 2D and 3D.
Recommendations
- On the asymptotic theory of subsampling
- Subsampling
- Subsampling in smoothed range spaces
- Sampling theorems for multivariate shift invariant subspaces
- A sampling theorem for shift-invariant subspace
- Irregular sampling in a generic subspace
- Subsampling needlet coefficients on the sphere
- Lattice invariant subspaces and sampling
Cited in
(27)- Generating nested quadrature rules with positive weights based on arbitrary sample sets
- Accelerating the Lawson-Hanson NNLS solver for large-scale Tchakaloff regression designs
- Computing Tchakaloff-like cubature rules on spline curvilinear polygons
- CQMC: an improved code for low-dimensional compressed quasi-MonteCarlo cubature
- Cubature rules with positive weights on union of disks
- Learning with subsampled kernel-based methods: environmental and financial applications
- Near optimal Tchakaloff meshes for compact sets with Markov exponent 2
- Compressed algebraic cubature over polygons with applications to optical design
- Jumping with variably scaled discontinuous kernels (VSDKs)
- Tchakaloff polynomial meshes
- Stable high-order cubature formulas for experimental data
- Monte Carlo construction of cubature on Wiener space
- InRS: implementing the indicator function of NURBS-shaped planar domains
- Tchakaloff-like compression of QMC volume and surface integration on the union of balls
- Random walks, equidistribution and graphical designs
- Monte Carlo cubature construction
- On generalized least power approximation
- Compressed sampling inequalities by Tchakaloff's theorem
- Algebraic cubature on polygonal elements with a circular edge
- Optimal polynomial meshes and Carathéodory-Tchakaloff submeshes on the sphere
- Exact discretization, tight frames and recovery via D-optimal designs
- Near G-optimal Tchakaloff designs
- Nearly optimal nested sensors location for polynomial regression on complex geometries
- Numerical hyperinterpolation over spherical triangles
- Quadrature-based polynomial optimization
- Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation
- Near-algebraic Tchakaloff-like quadrature on spherical triangles
This page was built for publication: Caratheodory-Tchakaloff Subsampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355361)
