A Unified Framework for Numerically Inverting Laplace Transforms

We introduce and investigate a framework for constructing algorithms to invert Laplace transforms numerically. Given a Laplace transform \hat{f} of a complex-valued function of a nonnegative real-variable, f , the function f is approximated by a finite linear combination of the transform values; i.e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:INFORMS journal on computing Jg. 18; H. 4; S. 408 - 421
Hauptverfasser: Abate, Joseph, Whitt, Ward
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Linthicum INFORMS 22.09.2006
Institute for Operations Research and the Management Sciences
Schlagworte:
Algorithms
Eulers equations
Forecasts and trends
Fourier analysis
Fourier-series method
Gaver-Stehfest algorithm
Laplace transformation
Laplace transforms
multi-precision computing
multidimensional Laplace transforms
multidimensional transform inversion
numerical transform inversion
Studies
Talbot's method
United States
ISSN:1091-9856, 1526-5528, 1091-9856
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We introduce and investigate a framework for constructing algorithms to invert Laplace transforms numerically. Given a Laplace transform \hat{f} of a complex-valued function of a nonnegative real-variable, f , the function f is approximated by a finite linear combination of the transform values; i.e., we use the inversion formula f(t) \approx f_n (t) \equiv \frac{1}{t} \sum_{k = 0}^{n}\omega_{k}\hat{f}\biggl(\frac{\alpha_{k}}{t}\biggr),\quad 0 < t < \infty, where the weights k and nodes k are complex numbers, which depend on n , but do not depend on the transform \hat{f} or the time argument t . Many different algorithms can be put into this framework, because it remains to specify the weights and nodes. We examine three one-dimensional inversion routines in this framework: the Gaver-Stehfest algorithm, a version of the Fourier-series method with Euler summation, and a version of the Talbot algorithm, which is based on deforming the contour in the Bromwich inversion integral. We show that these three building blocks can be combined to produce different algorithms for numerically inverting two-dimensional Laplace transforms, again all depending on the single parameter n . We show that it can be advantageous to use different one-dimensional algorithms in the inner and outer loops.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.1050.0137