Pith. sign in

REVIEW 1 cited by

Caratheodory-Tchakaloff Subsampling

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.02065 v2 pith:443IRMLW submitted 2016-11-07 math.NA cs.NA

Federico Piazzon , Alvise Sommariva , Marco Vianello This is my paper · ORCID
classification math.NAcs.NA
keywords caratheodory-tchakaloffpolynomialsubsamplingalgorithmapplicationbriefcatchcompact
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Efficient and Robust Carath\'{e}odory-Steinitz Pruning of Positive Discrete Measures

    math.NA 2025-10 accept novelty 6.0 of 10

    GSCSP prunes positive discrete measures to N-point moment-preserving rules in O(N^2) memory and O(MN^2+N^3) time, with a local total-variation Lipschitz stability theorem.

Pith tools