Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials.

DOI10.1016/j.jcp.2003.08.027zbMath1039.65002OpenAlexW2049704318WikidataQ59816106 ScholiaQ59816106MaRDI QIDQ1427839

Roi Baer, Chandra Saravanan, Wanzhen Liang, Yihan Shao, Martin Head-Gordon, Alexis T. Bell

Publication date: 14 March 2004

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2003.08.027

zbMATH Keywords

numerical examplesChebyshev matrix polynomialsfast resummation algorithms

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Computation of special functions and constants, construction of tables (65D20) Numerical summation of series (65B10) Numerical approximation and evaluation of special functions (33F05)

Related Items

Unnamed Item ⋮ Computing the matrix sine and cosine simultaneously with a reduced number of products ⋮ Pole-based approximation of the Fermi-Dirac function

Cites Work

• Unnamed Item
• Unnamed Item
• Kernel polynomial approximations for densities of states and spectral functions
• A note on the evaluation of matrix polynomials
• On the number of multiplications necessary to compute certain functions
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials