Verified Computation of Fast Decreasing Polynomials

Neli S. Dimitrova () and Svetoslav M. Markov ()
Additional contact information
Neli S. Dimitrova: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics
Svetoslav M. Markov: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics

A chapter in Developments in Reliable Computing, 1999, pp 229-240 from Springer

Abstract: 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.

Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-017-1247-7_18

Ordering information: This item can be ordered from
http://www.springer.com/9789401712477

DOI: 10.1007/978-94-017-1247-7_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().