.png){kind=icon}
.png){kind=icon}
Return
Two algorithms for computing the matrix cosine function
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2017.05.019.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The computation of matrix trigonometric functions has received remarkable attention in the last decades due to its usefulness in the solution of systems of second order linear differential equations. Several state-of-the-art algorithms have been provided recently for computing these matrix functions. In this work, we present two efficient algorithms based on Taylor series with forward and backward error analysis for computing the matrix cosine. A MATLAB implementation of the algorithms is compared to state-of-the-art algorithms, with excellent performance in both accuracy and cost. (C) 2017 Elsevier Inc. All rights reserved.
Keywords:
Matrix cosine
Scaling and recovering method
Taylor series
Forward error analysis
Backward error analysis
MATLAB
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
View more organizations