In this paper we derive a unitary eigendecomposition for a sequence of matrices which we call the periodic Schur decomposition. We prove its existence and discuss its application to the solution of periodic difference equations arising in control. We show how the classical QR algorithm can be extended to provide a stable algorithm for computing this generalized decomposition. We apply the decomposition also to cyclic matrices and two point boundary value problems
AbstractWe consider the problem of approximating the generalized Schur decomposition of a matrix pen...
We apply a Floquet-like theory to linear discrete-time periodic systems, and present an algorithm to...
AbstractWe firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant ...
. In this paper we derive a unitary eigendecomposition for a sequence of matrices which we call the...
We present a new method for eigenvalue assignment in linear periodic discrete-time systems through t...
We propose an elegant and conceptually simple method for computing the periodic solution of three cl...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
The periodic QR algorithm is a strongly backward stable method for computing the eigenvalues of prod...
The date of receipt and acceptance will be inserted by the editor Summary Stewart’s recently introdu...
Stewart's recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted A...
In this paper we derive a new algorithm for constructing unitary decomposition of a sequence of matr...
AbstractIn this paper, we obtain some estimates for the γ-diagonally and product γ-diagonally domina...
The date of receipt and acceptance will be inserted by the editor Summary Stewart's recently in...
The discrete-time positive periodic Lyapunov equations have important applications in the balancing ...
Let U \Gamma V be an n \Theta n pencil with unitary matrices U and V . An algorithm is presented whi...
AbstractWe consider the problem of approximating the generalized Schur decomposition of a matrix pen...
We apply a Floquet-like theory to linear discrete-time periodic systems, and present an algorithm to...
AbstractWe firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant ...
. In this paper we derive a unitary eigendecomposition for a sequence of matrices which we call the...
We present a new method for eigenvalue assignment in linear periodic discrete-time systems through t...
We propose an elegant and conceptually simple method for computing the periodic solution of three cl...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
The periodic QR algorithm is a strongly backward stable method for computing the eigenvalues of prod...
The date of receipt and acceptance will be inserted by the editor Summary Stewart’s recently introdu...
Stewart's recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted A...
In this paper we derive a new algorithm for constructing unitary decomposition of a sequence of matr...
AbstractIn this paper, we obtain some estimates for the γ-diagonally and product γ-diagonally domina...
The date of receipt and acceptance will be inserted by the editor Summary Stewart's recently in...
The discrete-time positive periodic Lyapunov equations have important applications in the balancing ...
Let U \Gamma V be an n \Theta n pencil with unitary matrices U and V . An algorithm is presented whi...
AbstractWe consider the problem of approximating the generalized Schur decomposition of a matrix pen...
We apply a Floquet-like theory to linear discrete-time periodic systems, and present an algorithm to...
AbstractWe firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant ...