Mixed-precision Paterson-Stockmeyer method for evaluating polynomials of matrices
From MaRDI portal
Cites work
- A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
- A new scaling and squaring algorithm for the matrix exponential
- A note on the evaluation of matrix polynomials
- Accuracy and Stability of Numerical Algorithms
- An Arbitrary Precision Scaling and Squaring Algorithm for the Matrix Exponential
- Anymatrix: an extensible MATLAB matrix collection
- Arbitrary precision algorithms for computing the matrix cosine and its Fréchet derivative
- Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems
- Functions of Matrices
- Matrix inverse trigonometric and inverse hyperbolic functions: theory and algorithms
- Mixed precision algorithms in numerical linear algebra
- Multiprecision algorithms for computing the matrix logarithm
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- New scaling-squaring Taylor algorithms for computing the matrix exponential
- Numerical Computation of the Matrix Exponential with Accuracy Estimate
- Numerical stability of algorithms at extreme scale and low precisions
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Optimality of the Paterson-Stockmeyer method for evaluating matrix polynomials and rational matrix functions
- Two algorithms for computing the matrix cosine function
This page was built for publication: Mixed-precision Paterson-Stockmeyer method for evaluating polynomials of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7004764)