DOIAbstract
AbstractThere are few normal Hessenberg matrices. The connection with moment matrices sheds light on the global convergence of the QR algorithm for nonsymmetric matrices
AbstractThere are few normal Hessenberg matrices. The connection with moment matrices sheds light on the global convergence of the QR algorithm for nonsymmetric matrices
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
AbstractI reconsider some hypotheses concerning errant behaviors of the m-tuple QP iteration for rea...
AbstractTwo different generalizations of the concept of Hessenberg matrices have appeared recently i...
AbstractThere are few normal Hessenberg matrices. The connection with moment matrices sheds light on...
AbstractWe examine global convergence properties of the Francis shifted QR algorithm on real, normal...
Several direct implementations of the QR algorithm for a unitary Hessenberg matrix are numerically u...
AbstractLet H be an n × n unitary right Hessenberg matrix with positive subdiagonal elements. Using ...
The QR-algorithm is a renowned method for computing all eigenvalues of an arbitrary matrix. A prelim...
The implicit Q theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in t...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
The implicit Q-theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in ...
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...
We consider the Givens QR factorization of banded Hessenberg-Toeplitz matrices of large order and re...
AbstractIn this paper we prove two consequences of the subnormal character of the Hessenberg matrix ...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
AbstractI reconsider some hypotheses concerning errant behaviors of the m-tuple QP iteration for rea...
AbstractTwo different generalizations of the concept of Hessenberg matrices have appeared recently i...
AbstractThere are few normal Hessenberg matrices. The connection with moment matrices sheds light on...
AbstractWe examine global convergence properties of the Francis shifted QR algorithm on real, normal...
Several direct implementations of the QR algorithm for a unitary Hessenberg matrix are numerically u...
AbstractLet H be an n × n unitary right Hessenberg matrix with positive subdiagonal elements. Using ...
The QR-algorithm is a renowned method for computing all eigenvalues of an arbitrary matrix. A prelim...
The implicit Q theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in t...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
The implicit Q-theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in ...
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...
We consider the Givens QR factorization of banded Hessenberg-Toeplitz matrices of large order and re...
AbstractIn this paper we prove two consequences of the subnormal character of the Hessenberg matrix ...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
AbstractI reconsider some hypotheses concerning errant behaviors of the m-tuple QP iteration for rea...
AbstractTwo different generalizations of the concept of Hessenberg matrices have appeared recently i...
Add to ORKG