Two algorithms for computing the matrix cosine function
From MaRDI portal
Recommendations
- Efficient computation of the matrix cosine
- Efficient and accurate algorithms for computing matrix trigonometric functions
- Efficient algorithms for the matrix cosine and sine
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials
Cites work
- A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
- An Algorithm for Computing the Matrix Cosine
- Bounds for variable degree rational L_ approximations to the matrix cosine
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials
- Efficient and accurate algorithms for computing matrix trigonometric functions
- Efficient computation of the matrix cosine
- Functions of Matrices
- High performance computing of the matrix exponential
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- New methods for oscillatory systems based on ARKN methods
- New scaling-squaring Taylor algorithms for computing the matrix exponential
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Rational approximations of trigonometric matrices with application to second-order systems of differential equations
Cited in
(22)- Computing the matrix cosine
- Efficient evaluation of matrix polynomials
- 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
- Boosting the computation of the matrix exponential
- 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
- Optimality of the Paterson-Stockmeyer method for evaluating matrix polynomials and rational matrix functions
- Fast Taylor polynomial evaluation for the computation of the matrix cosine
- Efficient computation of the matrix cosine
- Efficient algorithms for the matrix cosine and sine
- New Hermite series expansion for computing the matrix hyperbolic cosine
- Calculating a function of a matrix with a real spectrum
- Efficient and accurate algorithms for computing matrix trigonometric functions
- scientific article; zbMATH DE number 5526047 (Why is no real title available?)
- A truncated Taylor series algorithm for computing the action of trigonometric and hyperbolic matrix functions
- 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 Bernoulli series approximation for the matrix cosine
- Mixed-precision Paterson-Stockmeyer method for evaluating polynomials of matrices
- Efficient algorithm for the oscillatory matrix functions
This page was built for publication: Two algorithms for computing the matrix cosine function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740011)
