Published January 1, 2021
| Version v1
Journal article
Open
Computing the matrix sine and cosine simultaneously with a reduced number of products
- 1. Univ Jaume 1, Dept Matemat, Castellon de La Plana 12071, Spain
- 2. Univ Politecn Valencia, Inst Matemat Multidisciplinar, E-46022 Valencia, Spain
Description
A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be used in single and double precision arithmetic. The resulting algorithms are more efficient than schemes based on Pade approximations for a wide range of norm matrices. (C) 2021 IMACS. Published by Elsevier B.V. All rights reserved.
Files
bib-0a3f7b21-0710-4ef1-a7d7-e6d72f92d2ab.txt
Files
(193 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:740819c7da43784d1533e83a5d722345
|
193 Bytes | Preview Download |