Numerical Inversion of Laplace Transforms: An Efficient Improvement to Dubner and Abate's Method
Clicks: 1
ID: 297394
1974
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
0.0
/100
1 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
Ranked #35 of 36 articles by views in The Computer Journal
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
An accurate method is presented for the numerical inversion of Laplace transform, which is a natural continuation to Dubner and Abate's method. (Dubner and Abate, 1968). The advantages of this modified procedure are twofold: first, the error bound on the inverse f(t) becomes independent of t, instead of being exponential in t; second, and consequently, the trigonometric series obtained for f(t) in terms of F(s) is valid on the whole period 2T of the series. As it is proved, this error bound can be set arbitrarily small, and it is always possible to get good results, even in rather difficult cases. Particular implementations and numerical examples are presented.
| Reference Key |
openalex_W2171640513
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | F. Durbin |
| Journal | The Computer Journal |
| Year | 1974 |
| DOI |
10.1093/comjnl/17.4.371
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.