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

MaRDI QIDQ1920185zbMATH OpenFDO

Authors Heike Faßbender

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, http://www.emis.de/journals/ETNA/vol.4.1996/

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

numerical examplesalgorithminverse eigenvalue problemcomparison of methods[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Szeg%EF%BF%BD%EF%BF%BD+recursion&go=Go Szeg�� recursion]discrete least squares trigonometric polynomial approximationunitary Hessenberg matrix

Mathematics Subject Classification ID

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

Recommendations

• Discrete Least Squares Approximation by Trigonometric Polynomials
• scientific article; zbMATH DE number 741186
• On numerical methods for discrete least-squares approximation by trigonometric polynomials
• Vector Orthogonal Polynomials and Least Squares Approximation
• Orthonormal polynomial vectors and least squares approximation for a discrete inner product
• Approximation of scattered data by trigonometric polynomials on the torus and the 2-sphere
• Downdating of Szegö polynomials and data-fitting applications
• A parallel algorithm for discrete least squares rational approximation
• A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
• On polynomial approximation in the uniform norm by the discrete least squares method

Cited in

(2)

• Anti-Szego quadrature rules
• scientific article; zbMATH DE number 741186 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920185)