A computational algorithm for Rjabov’s method for real inversion of Laplace transforms

S. Cuomo, L. D’Amore and A. Murli
Additional contact information
S. Cuomo: Complesso Universario Monte S. Angelo, Università di Napoli “Federico II” and Center for Research on Parallel Computing and Supercomputers CPS-CNR
L. D’Amore: Complesso Universario Monte S. Angelo, Università di Napoli “Federico II” and Center for Research on Parallel Computing and Supercomputers CPS-CNR
A. Murli: Complesso Universario Monte S. Angelo, Università di Napoli “Federico II” and Center for Research on Parallel Computing and Supercomputers CPS-CNR

A chapter in Numerical Mathematics and Advanced Applications, 2003, pp 881-890 from Springer

Abstract: Summary The inversion of a Laplace transform on the real axis is an ill-conditioned problem. A complete error analysis of Rjabov’s method for the numerical inversion of the Laplace transform shows that a regularization technique is needed in order to compute an accurate numerical solution. The main contribution of this paper is to provide a reliable error estimate and then to show how readily one could develop an accurate and efficient stopping rule for the related numerical algorithm.

Date: 2003
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-88-470-2089-4_79

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

DOI: 10.1007/978-88-470-2089-4_79

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 ().