pith. sign in

arxiv: 1611.02065 · v2 · pith:443IRMLWnew · submitted 2016-11-07 · 🧮 math.NA

Caratheodory-Tchakaloff Subsampling

Federico Piazzon , Alvise Sommariva , Marco Vianello This is my paper
classification 🧮 math.NA
keywords caratheodory-tchakaloffpolynomialsubsamplingalgorithmapplicationbriefcatchcompact
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Fast computation and theoretical guarantees for the NPMLE in exponential family mixtures

    math.ST 2026-04 unverdicted novelty 6.0

    A data-compression technique reduces NPMLE computation cost to logarithmic in n for exponential family mixtures, while approximate NPMLEs attain near-parametric rates for marginal density estimation.