In this paperwe revisit the problem of finding an orthogonal similarity transformation that puts an n×n matrix A in a block upper-triangular form that reveals its Jordan structure at a particular eigenvalue λ0. The obtained form in fact reveals the dimensions of the null spaces of (A−λ0I)i at that eigenvalue via the sizes of the leading diagonal blocks, and from this the Jordan structure at λ0 is then easily recovered. The method starts from a Hessenberg form that already reveals several properties of the Jordan structure of A. It then updates the Hessenberg form in an efficient way to transform it to a block-triangular form in O(mn2) floating point operations, where m is the total multiplicity of the eigenvalue. The method only uses orthogonal...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
A new method of finding the eigenvalues and eigenvectors of an arbitrary complex matrix is presented...
The major obstacle to determination of the Jordan chains for a highly degenerated eigenproblem is th...
AbstractFor B∈Mm and C∈Mn we continue work in the direction of explicit determination of the Jordan ...
We present a direct algorithm for computing an orthogonal similarity transformation which interchang...
AbstractFor B∈Mm and C∈Mn we continue work in the direction of explicit determination of the Jordan ...
Abstract. Explicit relations between eigenvalues, eigenmatrix entries and matrix elements are derive...
AbstractLet A ϵ Mn, B ϵ Mm, and λ ϵ C be given. For X ϵ Mn,m we seek to determine the Jordan structu...
. An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is...
We show that if an n n Jordan block is perturbed by an O() upper k-Hessenberg matrix (k subdiagonal...
AbstractLet A ϵ Mn, B ϵ Mm, and λ ϵ C be given. For X ϵ Mn,m we seek to determine the Jordan structu...
In this paper we discuss algorithmic aspects of the computation of the Jordan canonical form. Inspir...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
A new method of finding the eigenvalues and eigenvectors of an arbitrary complex matrix is presented...
The major obstacle to determination of the Jordan chains for a highly degenerated eigenproblem is th...
AbstractFor B∈Mm and C∈Mn we continue work in the direction of explicit determination of the Jordan ...
We present a direct algorithm for computing an orthogonal similarity transformation which interchang...
AbstractFor B∈Mm and C∈Mn we continue work in the direction of explicit determination of the Jordan ...
Abstract. Explicit relations between eigenvalues, eigenmatrix entries and matrix elements are derive...
AbstractLet A ϵ Mn, B ϵ Mm, and λ ϵ C be given. For X ϵ Mn,m we seek to determine the Jordan structu...
. An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is...
We show that if an n n Jordan block is perturbed by an O() upper k-Hessenberg matrix (k subdiagonal...
AbstractLet A ϵ Mn, B ϵ Mm, and λ ϵ C be given. For X ϵ Mn,m we seek to determine the Jordan structu...
In this paper we discuss algorithmic aspects of the computation of the Jordan canonical form. Inspir...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
Given a matrix A ∈ Cn×n there exists a nonsingular matrix V such that V−1AV = J, where J is a very ...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...