Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


Fast and effective algorithms are discussed for resumming matrix polynomials and Chebyshev matrix polynomials. These algorithms lead to a significant speed-up in computer time by reducing the number of matrix multiplications required to roughly twice the square root of the degree of the polynomial. A few numerical tests are presented, showing that evaluation of matrix functions via polynomial expansions can be preferable when the matrix is sparse and these fast resummation algorithms are employed.

Original languageAmerican English
Pages (from-to)575-587
Number of pages13
JournalJournal of Computational Physics
Issue number2
StatePublished - 1 Mar 2004

Bibliographical note

Funding Information:
WZL would like to express her deep gratitude to Prof. Arup K. Chakraborty and Mr. Baron Peters for many stimulating discussions relevant to this work. Financial support from BP (WZL) and the Israel-US Binational Science Foundation (Baer & MHG) as well as support (MHG) from the National Science Foundation (CHE-9981997) are gratefully acknowledged. This work was also supported by funding from Q-Chem Inc via an SBIR subcontract from the National Institutes of Health (R43GM069255-01). MHG is a part owner of Q-Chem Inc.


Dive into the research topics of 'Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials'. Together they form a unique fingerprint.

Cite this