A parallel algorithm for discrete least squares rational approximation |
| |
Authors: | Marc Van Barel Adhemar Bultheel |
| |
Affiliation: | (1) Department of Computer Science, K.U. Leuven, Celestijnenlaan 200 A, B-3001 Leuven (Heverlee), Belgium |
| |
Abstract: | Summary A new method for discrete least squares linearized rational approximation is presented. It generalizes the algorithm of Rutishauser-Gragg-Harrod-Reichel for discrete least squares polynomial approximation to the rational case. The algorithm is fast in the sense that it requires orderm computation time wherem is the number of data points and is the degree of the approximant. We describe how this algorithm can be implemented in parallel. |
| |
Keywords: | 41A20 65D15 65W05 33A65 |
本文献已被 SpringerLink 等数据库收录! |