On numerical methods for discrete least-squares approximation by trigonometric polynomials
Open Access
- 1 April 1997
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (218) , 719-741
Abstract
Fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in [ 0 , 2 π ) [0,2\pi ) by trigonometric polynomials are presented. The algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only O ( m n ) (mn) arithmetic operations as compared to O ( m n 2 ) (mn^2) operations needed for algorithms that ignore the structure of the problem. An algorithm which solves this problem with real-valued data and real-valued solution using only real arithmetic is given. Numerical examples are presented that show that the proposed algorithms produce consistently accurate results that are often better than those obtained by general QR decomposition methods for the least-squares problem.Keywords
This publication has 10 references indexed in Scilit:
- A parallel algorithm for discrete least squares rational approximationNumerische Mathematik, 1992
- Schur parameter pencils for the solution of the unitary eigenproblemLinear Algebra and its Applications, 1991
- Discrete Least Squares Approximation by Trigonometric PolynomialsMathematics of Computation, 1991
- Constructing a Unitary Hessenberg Matrix from Spectral Data1991
- Fast QR factorization of Vandermonde matricesLinear Algebra and its Applications, 1989
- Rank revealing QR factorizationsLinear Algebra and its Applications, 1987
- On the eigenproblem for orthogonal matrices1986
- LINPACK Users' Guide1979
- Solution of Vandermonde Systems of EquationsMathematics of Computation, 1970
- Trigonometric Interpolation and Curve-FittingMathematics of Computation, 1970