Skip to main content
SpringerLink
Log in

General algorithm of computation of c-table and detection of valleys

  • Published:
Ukrainian Mathematical Journal Aims and scope

We present a review of all interesting results concerning the c-table obtained by the authors for the last two decades. These results are not widely known because they were presented in publications of limited circulation. We discuss different computational aspects of software producing the c-tables in the presence of blocs and their evolution following the evolution of the computer environment: effects of the use of 32-bit arithmetic .≈8 digits), 64-bit arithmetic (double precision, ≈16 digits), and Bailey’s Fortran multiprecision package .32 or 64 digits), competition between the ascending and descending algorithms, relationship between the complexity of computation and precision, overflow and underflow problems, competition between different formulas allowing one to overcome the blocs in the c-table, practical simple criterion of detecting numerical zeros in the c-table allowing to identify the blocs, and automatic detection of valleys.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. B. Gragg, “The Padé table and its relation to certain algorithms of numerical analysis,” SIAM Rev., 14, 1–62 (1972).

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Gilewicz, Padé Approximants, Springer, Berlin–Heidelberg–New York (1978).

  3. G. A. Baker, Jr., Essentials of Padé Approximants, Academic Press (1975).

  4. J. Gilewicz and A. Magnus, “Valleys in c-table,” Padé Approxim. Applied Proc. (Antwerp 1979) (Lect. Notes Math.), 765, 135–149 (1979).

    MathSciNet  Google Scholar 

  5. J. Gilewicz, “From a numerical technique to a method in the best Padé approximation,” in: J. Vinuesa (editor), Orthogonal Polynomials and Their Applications (Lect. Notes in Pure and Appl. Math.), 117 (1989), pp. 35–51.

  6. J. Gilewicz and E. Leopold, “Subroutine CTABLE for best Padé approximant detection,” Centre Phys. Théor., CNRS, Marseille (1981), Rep. CPT-81/P.1324.

  7. J. Gilewicz, Computation of the c-Table Related to the Padé Approximation, Rep. CPT-91/P. 2601 Centre Phys. Théor., CNRS, Marseille (1991).

  8. Bailey’s, Fortran Multiprecision Package, http://crd.lbl.gov/~dhbailey/mpdist/

  9. J. Vignes, “Review of stochastic approach to round-off error analysis and its applications,” Math. Comput. Simulat., 30, 481–491 (1988).

    Article  MATH  MathSciNet  Google Scholar 

  10. W. Guziński, PADELIB: program library for Padé approximation [in Polish], Warszawa, Inst. Nucl. Res. (1978).

  11. S. Paszkowski, “Evaluation of C-table,” J. Comput. Appl. Math., 44, 219–233 (1992).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de Physique Théorique, Marseille, France

    J. Gilewicz & M. Pindor

Authors
  1. J. Gilewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Pindor
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 62, No. 6, pp. 762–772, June, 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gilewicz, J., Pindor, M. General algorithm of computation of c-table and detection of valleys. Ukr Math J 62, 882–893 (2010). https://doi.org/10.1007/s11253-010-0397-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11253-010-0397-4

Keywords

Search

Navigation