Discrete least squares approximation by trigonometric polynomials
HTML articles powered by AMS MathViewer
- by L. Reichel, G. S. Ammar and W. B. Gragg PDF
- Math. Comp. 57 (1991), 273-289 Request permission
Abstract:
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in $[0,2\pi )$ by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only $O(mn)$ arithmetic operations as compared with $O(m{n^2})$ operations needed for algorithms that ignore the structure of the problem. Moreover, the proposed algorithm produces consistently accurate results that are often better than those obtained by general QR decomposition methods for the least squares problem. Our algorithm can also be used for discrete least squares approximation on the unit circle by algebraic polynomials.References
-
G. S. Ammar, W. B. Gragg, and L. Reichel, Constructing a unitary matrix from spectral data, Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms (G. H. Golub and P. Van Dooren, eds.), Springer-Verlag, New York, 1990, pp. 385-396.
- Jean-Paul Berrut, Baryzentrische Formeln zur trigonometrischen Interpolation. I, Z. Angew. Math. Phys. 35 (1984), no. 1, 91–105 (German, with English and French summaries). MR 753088, DOI 10.1007/BF00945179
- Åke Björck and Victor Pereyra, Solution of Vandermonde systems of equations, Math. Comp. 24 (1970), 893–903. MR 290541, DOI 10.1090/S0025-5718-1970-0290541-1
- Cédric J. Demeure, Fast $QR$ factorization of Vandermonde matrices, Linear Algebra Appl. 122/123/124 (1989), 165–194. MR 1019987, DOI 10.1016/0024-3795(89)90652-6 J. J. Dongarra, J. R. Bunch, C. B. Moler, and G. W. Stewart, LINPACK users’ guide, SIAM, Philadelphia, PA, 1979.
- George E. Forsythe, Generation and use of orthogonal polynomials for data-fitting with a digital computer, J. Soc. Indust. Appl. Math. 5 (1957), 74–88. MR 92208
- Walter Gautschi, On generating orthogonal polynomials, SIAM J. Sci. Statist. Comput. 3 (1982), no. 3, 289–317. MR 667829, DOI 10.1137/0903018
- Walter Gautschi, Orthogonal polynomials—constructive theory and applications, Proceedings of the international conference on computational and applied mathematics (Leuven, 1984), 1985, pp. 61–76. MR 793944, DOI 10.1016/0377-0427(85)90007-X
- Gene H. Golub and Charles F. Van Loan, Matrix computations, 2nd ed., Johns Hopkins Series in the Mathematical Sciences, vol. 3, Johns Hopkins University Press, Baltimore, MD, 1989. MR 1002570 W. B. Gragg, The QR algorithm for unitary Hessenberg matrices, J. Comput. Appl. Math. 16 (1986), 1-8.
- William B. Gragg and William J. Harrod, The numerically stable reconstruction of Jacobi matrices from spectral data, Numer. Math. 44 (1984), no. 3, 317–335. MR 757489, DOI 10.1007/BF01405565
- Ulf Grenander and Gábor Szegő, Toeplitz forms and their applications, 2nd ed., Chelsea Publishing Co., New York, 1984. MR 890515
- Peter Henrici, Applied and computational complex analysis. Vol. 3, Pure and Applied Mathematics (New York), John Wiley & Sons, Inc., New York, 1986. Discrete Fourier analysis—Cauchy integrals—construction of conformal maps—univalent functions; A Wiley-Interscience Publication. MR 822470
- A. C. R. Newbery, Trigonometric interpolation and curve-fitting, Math. Comp. 24 (1970), 869–876. MR 279966, DOI 10.1090/S0025-5718-1970-0279966-8 L. Reichel, Fast QR decomposition of Vandermonde-like matrices and polynomial least squares approximation, Numerical Analysis Report 89-5, Department of Mathematics, M.I.T., 1989.
Additional Information
- © Copyright 1991 American Mathematical Society
- Journal: Math. Comp. 57 (1991), 273-289
- MSC: Primary 65D15
- DOI: https://doi.org/10.1090/S0025-5718-1991-1079030-8
- MathSciNet review: 1079030