Efficient and accurate algorithms for computing matrix trigonometric functions
Publication:313622
DOI10.1016/J.CAM.2016.05.015zbMath1416.65126OpenAlexW2405598217MaRDI QIDQ313622
Jesús Peinado, Jorge Sastre, Pedro Alonso, Emilio Defez, Jacinto-Javier Ibáñez
Publication date: 12 September 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.05.015
Taylor seriesparallel implementationbackward errormatrix cosinematrix sinescaling and squaring method
Parallel numerical computation (65Y05) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (8)
Uses Software
Cites Work
- Accurate matrix exponential computation to solve coupled differential models in engineering
- High performance computing of the matrix exponential
- Efficient orthogonal matrix polynomial based method for computing matrix exponential
- Rational approximations of trigonometric matrices with application to second-order systems of differential equations
- Efficient computation of the matrix cosine
- FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation
- An Algorithm for Computing the Matrix Cosine
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- Functions of Matrices
- An updated set of basic linear algebra subprograms (BLAS)
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
This page was built for publication: Efficient and accurate algorithms for computing matrix trigonometric functions