The problem of generating a matrix A with specified eigenpairs, where A is a tridiagonal symmetric matrix, is presented. A general expression of such a matrix is provided, and the set of such matrices is denoted by S"E. Moreover, the corresponding least-...
This paper is concerned with the following problems: Problem I(a). Given a full column rank matrix X@?R^n^x^p and symmetric matrices B@?R^p^x^p and A"0@?R^r^x^r, find an nxn symmetric matrix A such thatX^TAX=B,A([1,r])=A"0, where A([1,r]) is the rxr ...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given some spectral information. Here, two inverse eigenvalue problems are solved. First, given the eigenvalues and the first components of the associated ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in