Pages that link to "Item:Q1740011"
From MaRDI portal
The following pages link to Two algorithms for computing the matrix cosine function (Q1740011):
Displaying 19 items.
- Efficient and accurate algorithms for computing matrix trigonometric functions (Q313622) (← links)
- Computing the matrix cosine (Q1413739) (← links)
- Efficient evaluation of matrix polynomials (Q1688882) (← links)
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations (Q1757341) (← links)
- Computing the matrix sine and cosine simultaneously with a reduced number of products (Q1995962) (← links)
- Boosting the computation of the matrix exponential (Q2007672) (← links)
- On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions (Q2088843) (← links)
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials (Q2256479) (← links)
- Optimality of the Paterson-Stockmeyer method for evaluating matrix polynomials and rational matrix functions (Q2419053) (← links)
- Fast Taylor polynomial evaluation for the computation of the matrix cosine (Q2423580) (← links)
- Efficient computation of the matrix cosine (Q2451346) (← links)
- Efficient algorithms for the matrix cosine and sine (Q2583233) (← links)
- New Hermite series expansion for computing the matrix hyperbolic cosine (Q2668029) (← links)
- Calculating a function of a matrix with a real spectrum (Q2672712) (← links)
- (Q3614236) (← links)
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously (Q5251940) (← links)
- Computing the Action of Trigonometric and Hyperbolic Matrix Functions (Q5738170) (← links)
- Arbitrary Precision Algorithms for Computing the Matrix Cosine and its Fréchet Derivative (Q5862807) (← links)
- On Bernoulli series approximation for the matrix cosine (Q6180315) (← links)
