Fast Taylor polynomial evaluation for the computation of the matrix cosine

被引:7
|
作者
Sastre, Jorge [1 ]
Ibanez, Javier [2 ]
Alonso-Jorda, Pedro [3 ]
Peinado, Jesus [3 ]
Defez, Emilio [4 ]
机构
[1] Inst Telecomunicac & Aplicac Multimedia, Valencia, Spain
[2] Inst Instrumentat Imagen Mol, Valencia, Spain
[3] Dept Informat Syst & Computat, Valencia, Spain
[4] Inst Matemat Multidisciplinar, Valencia, Spain
关键词
Matrix; Matrix trigonometric functions; Matrix cosine; Taylor; Fast matrix polynomial evaluation; GPU computing; ALGORITHMS; EFFICIENT;
D O I
10.1016/j.cam.2018.12.041
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this work we introduce a new method to compute the matrix cosine. It is based on recent new matrix polynomial evaluation methods for the Taylor approximation and a mixed forward and backward error analysis. The matrix polynomial evaluation methods allow to evaluate the Taylor polynomial approximation of the matrix cosine function more efficiently than using Paterson-Stockmeyer method. A sequential Matlab implementation of the new algorithm is provided, giving better efficiency and accuracy than state-of-the-art algorithms. Moreover, we provide an implementation in Matlab that can use NVIDIA CPUs easily and efficiently. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:641 / 650
页数:10
相关论文
共 50 条