.png){kind=icon}
.png){kind=icon}
Return
Euler polynomials for the matrix exponential approximation
.png){kind=icon}
OA
AI
DOI：10.1016/j.cam.2023.115074.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work, a new method to compute the matrix exponential function by using an approximation based on Euler polynomials is proposed. These polynomials are used in combination with the scaling and squaring technique, considering an absolute forward-type theoretical error. Its numerical and computational properties have been evaluated and compared with the most current and competitive codes dedicated to the computation of the matrix exponential. Under a heterogeneous test battery and a set of exhaustive experiments, it has been demonstrated that the new method offers performance in terms of accuracy and stability which is as good as or even better than those of the considered methods, with an intermediate computational cost among all of them. All of the above makes this a very competitive alternative that should be considered in the growing list of available numerical methods and implementations dedicated to the approximation of the matrix exponential.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords:
Matrix functions
Matrix exponential
Euler polynomials
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
354
Citations:
593
View more organizations