Linear minimum-variance approximants for noisy data

Abstract

Inspired by recent developments in subdivision schemes founded on the Weighted Least Squares technique, we construct linear approximants for noisy data in which the weighting strategy minimizes the output variance, thereby establishing a direct correspondence with the Generalized Least Squares and the Minimum-Variance Formulas methodologies. By introducing annihilation-operators for polynomial spaces, we derive usable formulas that are optimal for general correlated non-uniform noise. We show that earlier subdivision rules are optimal for uncorrelated non-uniform noise and, finally, we present numerical evidence to confirm that, in the correlated case, the proposed approximants are better than those currently used in the subdivision literature.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…