✦ LIBER ✦

Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials

✍ Scribed by WanZhen Liang; Roi Baer; Chandra Saravanan; Yihan Shao; Alexis T Bell; Martin Head-Gordon

Book ID: 118475087
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 152 KB
Volume: 194
Category: Article
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2003.08.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matrix methods for polynomials

✍ L. Laszlo 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 91 KB

The Chebyshev Polynomials of a Matrix

✍ Toh, Kim-Chuan; Trefethen, Lloyd N. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 580 KB

On the Bezoutian matrix for Chebyshev po

On the Bezoutian matrix for Chebyshev polynomials

✍ ZhengHong Yang; BingFei Cui 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Krylov type subspace methods for matrix

Krylov type subspace methods for matrix polynomials

✍ Leonard Hoffnung; Ren-Cang Li; Qiang Ye 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 329 KB

The operational matrix of fractional int

The operational matrix of fractional integration for shifted Chebyshev polynomials

✍ A.H. Bhrawy; A.S. Alofi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 217 KB

A Matrix Method for Chromatic Polynomial

A Matrix Method for Chromatic Polynomials

✍ Norman Biggs 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 111 KB

The chromatic polynomials of certain families of graphs can be expressed in terms of the eigenspaces of a linear operator. The operator is represented by a matrix, which is referred to here as the compatibility matrix. In this paper complete sets of eigenfunctions are obtained for several related fa