Skip to main content
SpringerLink
Log in

Verified Computation of Fast Decreasing Polynomials

  • Published:
Reliable Computing

Abstract

In this paper the problem of verified numerical computation of algebraic fast decreasing polynomials approximating the Dirac delta function is considered. We find the smallest degree of the polynomials and give precise estimates for this degree. It is shown that the computer algebra system Maple does not always graph such polynomials reliably because of evaluating the expressions in usual floating-point arithmetic. We propose a procedure for verified computation of the polynomials and use it to produce their correct graphic presentation in Maple.

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. Ahieser, N. I.: Elements of the Elliptic Functions Theory, Moscow, Nauka, 1970 (in Russian).

    Google Scholar 

  2. Char, B. W., Geddes, K. O., Gonnet, G. H., Leong, B. L., Monagan, M. B., and Watt, S. M.: First Leaves: A Tutorial Introduction to Maple V, Springer Verlag, 1992.

  3. Connel, A. E. and Corless, R. M.: An Experimental Interval Arithmetic Package in Maple, Interval Computations 2 (1993), pp. 120–134.

    Google Scholar 

  4. Ivanov, K. G. and Totik, V.: Fast Decreasing Polynomials, Constructive Approx. 6 (1990), pp. 1–20.

    Google Scholar 

  5. Sendov, B.: Hausdorff Approximations, Kluwer Academic Publ., London, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev str., Bl. 8, BG-1113, Sofia, Bulgaria

    Neli S. Dimitrova & Svetoslav M. Markov

Authors
  1. Neli S. Dimitrova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Svetoslav M. Markov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dimitrova, N.S., Markov, S.M. Verified Computation of Fast Decreasing Polynomials. Reliable Computing 5, 229–240 (1999). https://doi.org/10.1023/A:1009972120539

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009972120539

Keywords

Search

Navigation