A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials
Electronic transactions on numerical analysis, Tome 4 (1996), pp. 64-74
Recently fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in [0, $2\pi $) by trigonometric polynomials were presented in different papers. These algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only $O(mn)$ arithmetic operations as compared to $O(mn2)$ operations needed for algorithms that ignore the structure of the problem. In 1970 Newbery already presented a $O(mn)$ algorithm for solving the discrete least-squares approximation by trigonometric polynomials. In this paper the connection between the different algorithms is illustrated.
@article{ETNA_1996__4__a6,
author = {Fa{\ss}bender, Heike},
title = {A note on {Newbery's} algorithm for discrete least-squares approximation by trigonometric polynomials},
journal = {Electronic transactions on numerical analysis},
pages = {64--74},
year = {1996},
volume = {4},
zbl = {0862.65095},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_1996__4__a6/}
}
TY - JOUR AU - Faßbender, Heike TI - A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials JO - Electronic transactions on numerical analysis PY - 1996 SP - 64 EP - 74 VL - 4 UR - http://geodesic.mathdoc.fr/item/ETNA_1996__4__a6/ LA - en ID - ETNA_1996__4__a6 ER -
Faßbender, Heike. A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials. Electronic transactions on numerical analysis, Tome 4 (1996), pp. 64-74. http://geodesic.mathdoc.fr/item/ETNA_1996__4__a6/