Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials.
From MaRDI portal
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical approximation and evaluation of special functions (33F05) Numerical summation of series (65B10) Computation of special functions and constants, construction of tables (65D20)
Recommendations
Cites work
- A note on the evaluation of matrix polynomials
- scientific article; zbMATH DE number 1078257 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Kernel polynomial approximations for densities of states and spectral functions
- On the number of multiplications necessary to compute certain functions
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
Cited in
(6)- Pole-based approximation of the Fermi-Dirac function
- Computing the matrix sine and cosine simultaneously with a reduced number of products
- Evaluating matrix functions by resummations on graphs: the method of path-sums
- A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/
- Fast algorithms for discrete polynomial transforms
- scientific article; zbMATH DE number 7329538 (Why is no real title available?)
This page was built for publication: Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427839)