A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials

zbMath0862.65095MaRDI QIDQ1920185

Heike Fassbender

Publication date: 25 May 1997

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119094

zbMATH Keywords

algorithmcomparison of methodsnumerical examplesinverse eigenvalue problemdiscrete least squares trigonometric polynomial approximationSzegö recursionunitary Hessenberg matrix

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Trigonometric approximation (42A10) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical linear algebra (65F99)

Related Items (1)

Anti-Szego quadrature rules

This page was built for publication: A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials