The implicit Q-theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in the development of for example implicit QR-algorithms to compute the eigendecomposition of Hessenberg matrices. Moreover it can also be used to prove the essential uniqueness of orthogonal similarity transformations of matrices to Hessenberg form. The theorem is also valid for symmetric tridiagonal matrices, proving thereby also in the symmetric case its power. Currently there is a growing interest to so-called semiseparable matrices. These matrices can be considered as the inverses of tridiagonal matrices. In a similar way, one can consider Hessenberg-like matrices as the inverses of Hessenberg matrices. In this paper, we formulate and...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
Abstract. This paper proposes a new type of iteration for computing eigenvalues of semiseparable (pl...
AbstractIn this paper, we present a novel method for solving the unitary Hessenberg eigenvalue probl...
The implicit Q theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in t...
The QR-algorithm is a renowned method for computing all eigenvalues of an arbitrary matrix. A prelim...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Hermitian plus possibly unhermitian low rank matrices can be efficiently reduced into Hessenberg for...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If i...
In this paper an implicit (double) shifted QR-method for computing the eigenvalues of companion and ...
AbstractLie-algebraic generalizations of Hessenberg matrices are considered. We address the question...
AbstractThe inverse of a quasi-Hessenberg matrix is shown to have a simple structure. The result is ...
A unitary symplectic similarity transformation for certain Hamiltonian matrices to extended Hamilton...
This paper concerns the study of a unitary transformation from a generic real symmetric matrix $A$ ...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
Abstract. This paper proposes a new type of iteration for computing eigenvalues of semiseparable (pl...
AbstractIn this paper, we present a novel method for solving the unitary Hessenberg eigenvalue probl...
The implicit Q theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in t...
The QR-algorithm is a renowned method for computing all eigenvalues of an arbitrary matrix. A prelim...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Hermitian plus possibly unhermitian low rank matrices can be efficiently reduced into Hessenberg for...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If i...
In this paper an implicit (double) shifted QR-method for computing the eigenvalues of companion and ...
AbstractLie-algebraic generalizations of Hessenberg matrices are considered. We address the question...
AbstractThe inverse of a quasi-Hessenberg matrix is shown to have a simple structure. The result is ...
A unitary symplectic similarity transformation for certain Hamiltonian matrices to extended Hamilton...
This paper concerns the study of a unitary transformation from a generic real symmetric matrix $A$ ...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
Abstract. This paper proposes a new type of iteration for computing eigenvalues of semiseparable (pl...
AbstractIn this paper, we present a novel method for solving the unitary Hessenberg eigenvalue probl...