An efficient and accurate algorithm for computing the matrix cosine based on New Hermite approximations
[EN] In this work we introduce new rational-polynomial Hermite matrix expansions which allow us to obtain a new accurate and efficient method for computing the matrix cosine. This method is compared with other state-of-the-art methods for computing the matrix cosine, including a method based on Pade...
| Autores: | , , , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2019 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositório: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglês |
| OAI Identifier: | oai:riunet.upv.es:10251/145547 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/145547 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Matrix cosine Scaling and squaring method Hermite series Forward error Parallel implementation CUDA TEORIA DE LA SEÑAL Y COMUNICACIONES CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL MATEMATICA APLICADA |
| Resumo: | [EN] In this work we introduce new rational-polynomial Hermite matrix expansions which allow us to obtain a new accurate and efficient method for computing the matrix cosine. This method is compared with other state-of-the-art methods for computing the matrix cosine, including a method based on Pade approximants, showing a far superior efficiency, and higher accuracy. The algorithm implemented on the basis of this method can also be executed either in one or two NVIDIA GPUs, which demonstrates its great computational capacity. (C) 2018 Elsevier B.V. All rights reserved. |
|---|