Abstract: Alternative basis matrix multiplication algorithms are the fastest matrix multiplication algorithms in practice to date. However, are they numerically ...

Abstract Computing the roots of a scalar polynomial, or the eigenvalues of a matrix polynomial, expressed in the Chebyshev basis {𝑇𝑘(𝑥)} is a fundamental problem that arises in many applications.