Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learning
The Weeks method for the numerical inversion of the Laplace transform utilizes a Möbius transformation which is parameterized by two real quantities, σ and b . Proper selection of these parameters depends highly on the Laplace space function F ( s ) and is generally a nontrivial task. In this paper,...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2021-03-01
|
Series: | Journal of Algorithms & Computational Technology |
Online Access: | https://doi.org/10.1177/1748302621999621 |
id |
doaj-25b81f710f9a4aa3ba83e59208017904 |
---|---|
record_format |
Article |
spelling |
doaj-25b81f710f9a4aa3ba83e592080179042021-03-29T22:03:45ZengSAGE PublishingJournal of Algorithms & Computational Technology1748-30262021-03-011510.1177/1748302621999621Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learningPatrick O KanoMoysey BrioJacob BaileyThe Weeks method for the numerical inversion of the Laplace transform utilizes a Möbius transformation which is parameterized by two real quantities, σ and b . Proper selection of these parameters depends highly on the Laplace space function F ( s ) and is generally a nontrivial task. In this paper, a convolutional neural network is trained to determine optimal values for these parameters for the specific case of the matrix exponential. The matrix exponential e A is estimated by numerically inverting the corresponding resolvent matrix ( s I − A ) − 1 via the Weeks method at ( σ , b ) pairs provided by the network. For illustration, classes of square real matrices of size three to six are studied. For these small matrices, the Cayley-Hamilton theorem and rational approximations can be utilized to obtain values to compare with the results from the network derived estimates. The network learned by minimizing the error of the matrix exponentials from the Weeks method over a large data set spanning ( σ , b ) pairs. Network training using the Jacobi identity as a metric was found to yield a self-contained approach that does not require a truth matrix exponential for comparison.https://doi.org/10.1177/1748302621999621 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Patrick O Kano Moysey Brio Jacob Bailey |
spellingShingle |
Patrick O Kano Moysey Brio Jacob Bailey Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learning Journal of Algorithms & Computational Technology |
author_facet |
Patrick O Kano Moysey Brio Jacob Bailey |
author_sort |
Patrick O Kano |
title |
Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learning |
title_short |
Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learning |
title_full |
Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learning |
title_fullStr |
Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learning |
title_full_unstemmed |
Optimal parameter selection in Weeks’ method for numerical Laplace transform inversion based on machine learning |
title_sort |
optimal parameter selection in weeks’ method for numerical laplace transform inversion based on machine learning |
publisher |
SAGE Publishing |
series |
Journal of Algorithms & Computational Technology |
issn |
1748-3026 |
publishDate |
2021-03-01 |
description |
The Weeks method for the numerical inversion of the Laplace transform utilizes a Möbius transformation which is parameterized by two real quantities, σ and b . Proper selection of these parameters depends highly on the Laplace space function F ( s ) and is generally a nontrivial task. In this paper, a convolutional neural network is trained to determine optimal values for these parameters for the specific case of the matrix exponential. The matrix exponential e A is estimated by numerically inverting the corresponding resolvent matrix ( s I − A ) − 1 via the Weeks method at ( σ , b ) pairs provided by the network. For illustration, classes of square real matrices of size three to six are studied. For these small matrices, the Cayley-Hamilton theorem and rational approximations can be utilized to obtain values to compare with the results from the network derived estimates. The network learned by minimizing the error of the matrix exponentials from the Weeks method over a large data set spanning ( σ , b ) pairs. Network training using the Jacobi identity as a metric was found to yield a self-contained approach that does not require a truth matrix exponential for comparison. |
url |
https://doi.org/10.1177/1748302621999621 |
work_keys_str_mv |
AT patrickokano optimalparameterselectioninweeksmethodfornumericallaplacetransforminversionbasedonmachinelearning AT moyseybrio optimalparameterselectioninweeksmethodfornumericallaplacetransforminversionbasedonmachinelearning AT jacobbailey optimalparameterselectioninweeksmethodfornumericallaplacetransforminversionbasedonmachinelearning |
_version_ |
1724192251699003392 |