Summary
The paper deals with the finite rational least squares approximation to a discrete function. An approximation without poles and depending on a parameterɛ is defined which tends to the least squares approximation forɛ → 0. It gives an “acceptable” approximation when the least squares approximation does not exist. Further it is shown that, if the discrete function to be fitted is sufficiently close to a rational function, then the least squares approximation exists.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cheney, E. W., andA. A. Goldstein: Mean-square approximation by generalized rational functions. Math. Zeitschr.95, 232–241 (1967)
Marquardt, D. W.: An algorithm for least-squares estimation of nonlinear parameters. SIAM J. Appl. Math.11, 431–441 (1963).
Meeter, Duane A.: On a theorem used in nonlinear least squares. SIAM J. Appl. Math.14, 1176–1179 (1966).
Pereyra, V.: Iterative methods for solving nonlinear least squares problems. SIAM J. Numer. Anal.4, 27–36 (1967)
Pomentale, T.: A new method for solving conditioned maxima problems. J. Math. Anal. Appl.10, 216–220 (1965)
Powell, M. J. D.: A method for minimizing a sum of squares of non-linear functions without calculating derivatives. Comput. J.7, 303–307 (1965)
Stoer, J.: Über zwei Algorithmen zur Interpolation mit rationalen Funktionen. Num. Math.3, 285–304 (1961).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pomentale, T. On discrete rational least squares approximation. Numer. Math. 12, 40–46 (1968). https://doi.org/10.1007/BF02170995
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02170995