Skip to main content
Log in

An algorithm for rational interpolation similar to theqd-algorithm

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

The problem of the construction of a table of interpolating rational functions is considered. A description of the methods of Larkin and Stoer for solving this problem is given. A new algorithm is derived for computing continued fractions whose convergents form the elements of the table. This algorithm has theqd-algorithm as a special case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Henrici, P.: Elements of numerical analysis. New York: John Wiley 1964.

    Google Scholar 

  2. Hildebrand, F. B.: Introduction to numerical analysis. New York: McGraw-Hill 1956.

    Google Scholar 

  3. Larkin, F. M.: Some techniques for rational interpolation. Computer J.10, 178–187 (1967).

    Google Scholar 

  4. Larkin, F. M.: A class of methods for tabular interpolation. Proc. Cambridge Philos. Soc.63, 1101–1114 (1967).

    Google Scholar 

  5. Meinguet, J.: On the solubility of the Cauchy interpolation problem. In “Approximation theory” (edited by A. Talbot, London: Academic Press), 137–164 (1970).

    Google Scholar 

  6. Perron, O.: Die Lehre von den Kettenbrüchen. Leipzig: Teubner 1929

    Google Scholar 

  7. Rutishauser, H.: Der Quotienten-Differenzen-Algorithmus. Basel: Birkhäuser Verlag 1957.

    Google Scholar 

  8. Rutishauser, H.: Stabile Sonderfälle des Quotienten-Differenzen-Algorithmus. Numer. Math.5, 95–112 (1963).

    Google Scholar 

  9. Stoer, J.: Über zwei Algorithmen zur Interpolation mit rationalen Funktionen. Numer. Math.3, 285–304 (1961).

    Google Scholar 

  10. Stoer, J.: A direct method for Chebyshev approximation by rational functions. Journ. Assoc. Comput. Mach.11, 59–69 (1964).

    Google Scholar 

  11. Tukey, J., Thacher, H. C.: Recursive algorithm for interpolation by rational functions. Unpublished manuscript, 1960.

  12. Werner, H.: Eine Faktorisierung der bei der rationalen Interpolation auftretenden Matrizen. Numer. Math.18, 423–431 (1972).

    Google Scholar 

  13. Wetterling, W.: Ein Interpolationsverfahren zur Lösung der linearen Gleichungssysteme, die bei der rationalen Tschebyscheff-Approximation auftreten. Arch. Rat. Mechan. Anal.12, 403–408 (1963).

    Google Scholar 

  14. Wuytack, L.: A new technique for rational extrapolation to the limit. Numer. Math.17, 215–221 (1971).

    Google Scholar 

  15. Wuytack, L.: On some aspects of the rational interpolation problem. SIAM J. Numer. Anal., to appear.

  16. Wynn, P.: On the propagation of error in certain non-linear algorithms. Numer. Math.1, 142–149 (1959).

    Google Scholar 

  17. Wynn, P.: Über einen Interpolations-Algorithmus und gewisse andere Formeln, die in der Theorie der Interpolation durch rationale Funktionen bestehen. Numer. Math.2, 151–182 (1960).

    Google Scholar 

  18. Wynn, P.: Singular rules for certain non-linear algorithms. BIT3, 175–195 (1963).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported in part by the NFWO (Belgium) and a NATO-Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wuytack, L. An algorithm for rational interpolation similar to theqd-algorithm. Numer. Math. 20, 418–424 (1972). https://doi.org/10.1007/BF01402564

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01402564

Keywords

Navigation