Add to ORKGIn this paper, the reduction with a scaling strategy from Hessenberg matrix to Frobenius-like form is given. An estimation of backward error propagation and numerical tests demonstrate that the reduction to Frobenius-like form and the operation on quasi-Routh array are numerically stable and they can be addressed for numerical determination of matrix stability
The interplay between structured matrices and corresponding systems of polynomials is a classical to...
The importance of the stability problem for matrices of the special form called mammillary matrices ...
AbstractLet D be a Hessenberg matrix and D the closed operator associated to it. In this work, we st...
In this paper, the reduction with a scaling strategy from Hessenberg matrix to Frobenius-like form i...
It is well known that the transformation of a matrix to Frobenius companion form may be numerically ...
In this paper an origin-shifted algorithm for matrix eigenvalues based on Frobenius-like form of mat...
International audienceThe reduction of a matrix to an upper J-Hessenberg form is a crucial step in t...
Several direct implementations of the QR algorithm for a unitary Hessenberg matrix are numerically u...
Abstract In this paper, a modification of the blocked algorithm for reduction to Hessenberg form is ...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
AbstractA simple algorithm for computing the first n powers of an n×n Hessenberg matrix with unit co...
The reduction of a general dense and square matrix to Hessenberg form is a well known first step in ...
In this paper we explore how close a given stable matrix A is to being unstable. As a measure of "h...
Frobenius canonical form is a canonical form of a square matrix over a field. An algorithm of comput...
nag_dhseqr (f08pec) computes all the eigenvalues, and optionally the Schur factorization, of a real ...
The interplay between structured matrices and corresponding systems of polynomials is a classical to...
The importance of the stability problem for matrices of the special form called mammillary matrices ...
AbstractLet D be a Hessenberg matrix and D the closed operator associated to it. In this work, we st...
In this paper, the reduction with a scaling strategy from Hessenberg matrix to Frobenius-like form i...
It is well known that the transformation of a matrix to Frobenius companion form may be numerically ...
In this paper an origin-shifted algorithm for matrix eigenvalues based on Frobenius-like form of mat...
International audienceThe reduction of a matrix to an upper J-Hessenberg form is a crucial step in t...
Several direct implementations of the QR algorithm for a unitary Hessenberg matrix are numerically u...
Abstract In this paper, a modification of the blocked algorithm for reduction to Hessenberg form is ...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
AbstractA simple algorithm for computing the first n powers of an n×n Hessenberg matrix with unit co...
The reduction of a general dense and square matrix to Hessenberg form is a well known first step in ...
In this paper we explore how close a given stable matrix A is to being unstable. As a measure of "h...
Frobenius canonical form is a canonical form of a square matrix over a field. An algorithm of comput...
nag_dhseqr (f08pec) computes all the eigenvalues, and optionally the Schur factorization, of a real ...
The interplay between structured matrices and corresponding systems of polynomials is a classical to...
The importance of the stability problem for matrices of the special form called mammillary matrices ...
AbstractLet D be a Hessenberg matrix and D the closed operator associated to it. In this work, we st...