In this paper we concern the reconstruction of an hermitian Toeplitz matrices with prescribed eigenpairs. Based on the fact that every centrohermitian matrix can be re- duced to a real matrix by a simple similarity transformation, we rst consider the eigenstructure of hermitian Toeplitz matrices and then discuss a related reconstruction problem. We show that the di- mension of the subspace of hermitian Toeplitz matrices with two given eigenvectors is at least two and independent of the size of the matrix, and the solution of the reconstruction problem of an hermitian Toeplitz matrix with two given eigenpairs is unique.Fundação para a Ciência e a Tecnologia (FCT) - Research Programme POCTINational Natural Science Foundation of China -...
AbstractA partially described inverse eigenvalue problem and an associated optimal approximation pro...
AbstractThe inverse eigenvalue problem for Toeplitz matrices (ITEP), concerning the reconstruction o...
Matrix-less methods (MLM) have successfully been used to efficiently approximate the eigenvalues of ...
Abstract Toeplitz matrices have been found important applications in bioinformatics and compu-tation...
Abstract Toeplitz matrices have found important applications in bioinformatics and computa-tional bi...
AbstractAn iterative procedure is proposed for computing the eigenvalues and eigenvectors of a class...
In this work, a number of advances are described which we feel lead to better understanding and solu...
An iterative method based on displacement structure is proposed for computing eigenvalues and eigenv...
We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplit...
A novel method for computing the minimal eigenvalue of a symmetric positive definite Toeplitz matrix...
AbstractA negative answer to the question “Is every matrix similar to a Toeplitz matrix?” raised by ...
AbstractIn this paper we discuss the problem whether and how the inverse of a Toeplitz matrix can be...
AbstractWe show that every n×n complex nonderogatory matrix is similar to a unique unit upper Hessen...
Iterative methods for inverse eigenvalue problems involve simultaneous approximation of the matrix b...
The inverse eigenvalue problem for Toeplitz matrices (ITEP), concerning the reconstruction of a symm...
AbstractA partially described inverse eigenvalue problem and an associated optimal approximation pro...
AbstractThe inverse eigenvalue problem for Toeplitz matrices (ITEP), concerning the reconstruction o...
Matrix-less methods (MLM) have successfully been used to efficiently approximate the eigenvalues of ...
Abstract Toeplitz matrices have been found important applications in bioinformatics and compu-tation...
Abstract Toeplitz matrices have found important applications in bioinformatics and computa-tional bi...
AbstractAn iterative procedure is proposed for computing the eigenvalues and eigenvectors of a class...
In this work, a number of advances are described which we feel lead to better understanding and solu...
An iterative method based on displacement structure is proposed for computing eigenvalues and eigenv...
We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplit...
A novel method for computing the minimal eigenvalue of a symmetric positive definite Toeplitz matrix...
AbstractA negative answer to the question “Is every matrix similar to a Toeplitz matrix?” raised by ...
AbstractIn this paper we discuss the problem whether and how the inverse of a Toeplitz matrix can be...
AbstractWe show that every n×n complex nonderogatory matrix is similar to a unique unit upper Hessen...
Iterative methods for inverse eigenvalue problems involve simultaneous approximation of the matrix b...
The inverse eigenvalue problem for Toeplitz matrices (ITEP), concerning the reconstruction of a symm...
AbstractA partially described inverse eigenvalue problem and an associated optimal approximation pro...
AbstractThe inverse eigenvalue problem for Toeplitz matrices (ITEP), concerning the reconstruction o...
Matrix-less methods (MLM) have successfully been used to efficiently approximate the eigenvalues of ...