Pages that link to "Item:Q1688882"
From MaRDI portal
The following pages link to Efficient evaluation of matrix polynomials (Q1688882):
Displaying 20 items.
- Efficient mixed rational and polynomial approximation of matrix functions (Q388611) (← links)
- Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials. (Q1427839) (← links)
- On fast computation of a polynomial in the Frobenius matrix (Q1571128) (← 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)
- An efficient algorithm to compute the exponential of skew-Hermitian matrices for the time integration of the Schrödinger equation (Q2076763) (← links)
- On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions (Q2088843) (← 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)
- New Hermite series expansion for computing the matrix hyperbolic cosine (Q2668029) (← links)
- Calculating a function of a matrix with a real spectrum (Q2672712) (← links)
- (Q3086664) (← links)
- (Q3313195) (← links)
- Reliable numerical methods for polynomial matrix triangularization (Q4506705) (← links)
- Computing Enclosures for the Matrix Exponential (Q5146627) (← links)
- Special matrix functions: characteristics, achievements and future directions (Q5205777) (← links)
- Euler polynomials for the matrix exponential approximation (Q6157965) (← links)
- On Bernoulli series approximation for the matrix cosine (Q6180315) (← links)
- Computational graphs for matrix functions (Q6599989) (← links)
