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 presentations in Maple.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahieser, N. I.: Elements of the Elliptic Functions Theory, Moscow, Nauka, 1970 (in Russian).
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.
Connel, A. E. and Corless, R. M.: An Experimental Interval Arithmetic Package in Maple, Interval Computations 2 (1993), pp. 120–134.
Ivanov, K. G. and Totik, V.: Fast Decreasing Polynomials, Constructive Approx. 6 (1990), pp. 1–20.
Sendov, B.: Hausdorff Approximations, Kluwer Academic Publ., London, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Dimitrova, N.S., Markov, S.M. (1999). Verified Computation of Fast Decreasing Polynomials. In: Csendes, T. (eds) Developments in Reliable Computing. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1247-7_18
Download citation
DOI: https://doi.org/10.1007/978-94-017-1247-7_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5350-3
Online ISBN: 978-94-017-1247-7
eBook Packages: Springer Book Archive