<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In the paper we present results of accuracy evaluation of numerous numerical algorithms for the numerical approximation of the Inverse Laplace Transform. The selected algorithms represent diverse lines of approach to this problem and include methods by Stehfest, Abate and Whitt, Vlach and Singhai, De Hoog, Talbot, Zakian and a one in which the FFT is applied for the Fourier series convergence acceleration. We use C++ and Python languages with arbitrary precision mathematical libraries to address some crucial issues of numerical implementation. The test set includes Laplace transforms considered as difficult to compute as well as some others commonly applied in fractional calculus. Evaluation results enable to conclude that the Talbot method which involves deformed Bromwich contour integration, the De Hoog and the Abate and Whitt methods using Fourier series expansion with accelerated convergence can be assumed as general purpose high-accuracy algorithms. They can be applied to a wide variety of inversion problems.</p></abstract>

In the paper we present results of accuracy evaluation of numerous numerical algorithms for the numerical approximation of the Inverse Laplace Transform. The selected algorithms represent diverse lines of approach to this problem and include methods by Stehfest, Abate and Whitt, Vlach and Singhai, De Hoog, Talbot, Zakian and a one in which the FFT is applied for the Fourier series convergence acceleration. We use C++ and Python languages with arbitrary precision mathematical libraries to address some crucial issues of numerical implementation. The test set includes Laplace transforms considered as difficult to compute as well as some others commonly applied in fractional calculus. Evaluation results enable to conclude that the Talbot method which involves deformed Bromwich contour integration, the De Hoog and the Abate and Whitt methods using Fourier series expansion with accelerated convergence can be assumed as general purpose high-accuracy algorithms. They can be applied to a wide variety of inversion problems.

Review of numerical methods for NumILPT with computational accuracy assessment for fractional calculus

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

In the paper we present results of accuracy evaluation of numerous numerical algorithms for the numerical approximation of the Inverse Laplace Transform. The...

Review of numerical methods for NumILPT with computational accuracy assessment for fractional calculus

Pubblicato online: 01 dic 2018

Pagine: 487 - 502

Ricevuto: 26 ago 2018

Accettato: 26 nov 2018

DOI: https://doi.org/10.2478/AMNS.2018.2.00038

Parole chiave
Numerical Approximation of the Inverse Laplace Transform, Fractional order differential Equations, Multi-precision Computing

© 2018 Dariusz W. Brzeziński, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Review of numerical methods for NumILPT with computational accuracy assessment for fractional calculus

Pubblicato online: 01 dic 2018

Pagine: 487 - 502

Ricevuto: 26 ago 2018

Accettato: 26 nov 2018

DOI: https://doi.org/10.2478/AMNS.2018.2.00038

Parole chiaveNumerical Approximation of the Inverse Laplace Transform, Fractional order differential Equations, Multi-precision Computing

© 2018 Dariusz W. Brzeziński, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Parole chiave
Numerical Approximation of the Inverse Laplace Transform, Fractional order differential Equations, Multi-precision Computing