Computing the matrix sine and cosine simultaneously with a reduced number of products
[EN] 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 re...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2021 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/181548 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/181548 |
| Access Level: | acceso abierto |
| Palabra clave: | Matrix sine Matrix cosine Taylor series Pade approximation Matrix polynomials |
| Sumario: | [EN] 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. |
|---|