Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis Daniel Kressner∗ Jose E. Roman†

First Page		Document Content
Date: 2013-11-05 04:06:54		Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis Daniel Kressner∗ Jose E. Roman† Add to Reading List Source URL: sma.epfl.ch Download Document from Source Website File Size: 270,73 KB Share Document on Facebook