Skip to main content
Log in

Implementation of the recurrence relations of biorthogonality

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

The aim of this work is the implementation of general algorithms for computing some generalized Padé-type approximants [1]. The quality of these approximants depends on the choice of some functionals. In the classical example of the seriesf(t)=log(1+t)/t we found functionals that give better results than the usual ones.

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. C. Brezinski,Biorthogonality and its Applications to Numerical Analysis (Marcel Dekker, New York 1992).

    Google Scholar 

  2. C. Brezinski and M. Redivo Zaglia,Extrpolation Methods. Theory and Practice (North-Holland, Amsterdam, 1991).

    Google Scholar 

  3. C. Brezinski, Rational approximation to formal power series, J. Approx. Theory 25 (1979) 295–317.

    Article  Google Scholar 

  4. S. Wolfram,Mathematica TM (Addison-Wesley, Reading, MA, 1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Da Rocha, Z. Implementation of the recurrence relations of biorthogonality. Numer Algor 3, 173–183 (1992). https://doi.org/10.1007/BF02141926

Download citation

  • Issue Date:

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

Subject classifications

Keywords

Navigation