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.
In this paper, we discuss an inverse eigenvalue problem for constructing a 2n × 2n Jacobi matrix T such that its 2n eigenvalues are given distinct real values and its leading principal submatrix of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback