Efficient computation of the matrix cosine
From MaRDI portal
Publication:2451346
Recommendations
- Efficient algorithms for the matrix cosine and sine
- Computing the matrix cosine
- Two algorithms for computing the matrix cosine function
- Efficient and accurate algorithms for computing matrix trigonometric functions
- Fast Taylor polynomial evaluation for the computation of the matrix cosine
- Computing the matrix sine and cosine simultaneously with a reduced number of products
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- A matrix hyperbolic cosine algorithm and applications
- Efficient complex matrix multiplication
Cites work
- A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
- A new scaling and squaring algorithm for the matrix exponential
- Accurate matrix exponential computation to solve coupled differential models in engineering
- An Algorithm for Computing the Matrix Cosine
- Benchmarking optimization software with performance profiles.
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials
- Computing the matrix cosine
- Efficient algorithms for the matrix cosine and sine
- Efficient orthogonal matrix polynomial based method for computing matrix exponential
- Functions of Matrices
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Rational approximations of trigonometric matrices with application to second-order systems of differential equations
- The Scaling and Squaring Method for the Matrix Exponential Revisited
Cited in
(23)- Computing the matrix cosine
- Two algorithms for computing the matrix cosine function
- A note on trigonometric identities involving non-commuting matrices
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
- Computing the matrix sine and cosine simultaneously with a reduced number of products
- On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials
- Solving engineering models using hyperbolic matrix functions
- Fast Taylor polynomial evaluation for the computation of the matrix cosine
- An improved algorithm to compute circular functions of Poisson series
- Efficient algorithms for the matrix cosine and sine
- New Hermite series expansion for computing the matrix hyperbolic cosine
- Efficient and accurate algorithms for computing matrix trigonometric functions
- A truncated Taylor series algorithm for computing the action of trigonometric and hyperbolic matrix functions
- A new type of Hermite matrix polynomial series
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- Computing the action of trigonometric and hyperbolic matrix functions
- Arbitrary precision algorithms for computing the matrix cosine and its Fréchet derivative
- On the hyperbolic Horadam matrix functions
- Computational graphs for matrix functions
- Quantum matrix calculus
- Polynomial approximations for the matrix logarithm with computation graphs
- Efficient algorithm for the oscillatory matrix functions
This page was built for publication: Efficient computation of the matrix cosine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451346)
