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.

Eigenvalue problems are a cornerstone of modern applied mathematics, arising in diverse fields from quantum mechanics to structural engineering. At their heart, these problems seek scalar values and ...

This expository paper explores the relationships among a number of algorithms for solving eigenvalue problems, including the power method, subspace iteration, the QR algorithm, and the Arnoldi and ...

Matrix polynomials and moment problems are significant areas of study in mathematics, particularly in the fields of control theory, numerical analysis, and probability. Matrix polynomials are ...

Focuses on numerical solution of nonlinear equations, interpolation, methods in numerical integration, numerical solution of linear systems, and matrix eigenvalue problems. Stresses significant ...

I just got done with my matrix algebra final. I think I did really shitty. But I had to pee really bad the whole time, so it wasn't entirely my fault.<BR><BR>This problem in particular was ...

General aspects of polynomial interpolation theory. Formulations in different basis, e.g. Lagrange, Newton etc. and their approximation and computational properties ...