On Bernoulli series approximation for the matrix cosine
[EN] This paper presents a new series expansion based on Bernoulli matrix polynomials to approximate the matrix cosine function. An approximation based on this series is not a straightforward exercise since there exist different options to implement such a solution. We dive into these options and in...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2022 |
| 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/192123 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/192123 |
| Access Level: | acceso abierto |
| Palabra clave: | Matrix exponential Polynomials and matrices Matrices MATEMATICA APLICADA CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL |
| Sumario: | [EN] This paper presents a new series expansion based on Bernoulli matrix polynomials to approximate the matrix cosine function. An approximation based on this series is not a straightforward exercise since there exist different options to implement such a solution. We dive into these options and include a thorough comparative of performance and accuracy in the experimental results section that shows benefits and downsides of each one. Also, a comparison with the Pade approximation is included. The algorithms have been implemented in MATLAB and in CUDA for NVIDIA GPUs. |
|---|