arXiv Analytics

Sign in

arXiv:2406.06008 [math.NA]AbstractReferencesReviewsResources

Efficient algorithm for the oscillatory matrix functions

Dongping Li, Xue Wang, Xiuying Zhang

Published 2024-06-10Version 1

This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and restoring technique based on a quadruple angle formula in conjunction with a truncated Taylor series. The choice of the scaling parameter and the degree of the Taylor polynomial relies on a forward error analysis. Numerical experiments show that the new algorithm behaves in a stable fashion and performs well in both accuracy and efficiency.

Related articles: Most relevant | Search more
arXiv:1502.06401 [math.NA] (Published 2015-02-23)
An efficient algorithm based on splitting for the time integration of the Schrödinger equation
arXiv:math/9804133 [math.NA] (Published 1998-04-28)
An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix
arXiv:2108.05110 [math.NA] (Published 2021-08-11)
An efficient algorithm for simulating ensembles of parameterized MHD flow problems