Journal of computational and applied mathematics vol:50 issue:1-3 pages:545-563
International Conference on Computational and Applied Mathematics location:Leuven, BE date:August, 1992
We already generalized the Rutishauser-Gragg-Harrod-Reichel algorithm for discrete least-squares polynomial approximation on the real axis to the rational case. In this paper, a new method for discrete least-squares linearized rational approximation on the unit circle is presented. It generalizes the algorithm of Reichel-Ammar-Gragg for discrete least-squares polynomial approximation on the unit circle to the rational case. The algorithm is fast in the sense that it requires order ma computation time where m is the number of data points and a is the degree of the approximant. We describe how this algorithm can be implemented in parallel. Examples illustrate the numerical behavior of the algorithm.