Reformulating local polynomial fitting with orthogonal Chebyshev polynomials yields two algorithms that cut memory use, improve scalability, and deliver orders-of-magnitude better numerical accuracy than Vandermonde-based methods for Savitzky-Golay filters.
AutomaticSelectionofOptimalSavitzky– Golay Smoothing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.data-an 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast and accurate noise removal by curve fitting using orthogonal polynomials
Reformulating local polynomial fitting with orthogonal Chebyshev polynomials yields two algorithms that cut memory use, improve scalability, and deliver orders-of-magnitude better numerical accuracy than Vandermonde-based methods for Savitzky-Golay filters.