Upper and lower bounds for the eigenvalues of three types of matrices M are established. If M is written as the sum of a diagonal matrix D plus a matrix A, the real parts of the eigenvalues of M must ...
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.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback