AbstractThe algebraic Riccati equation can be solved by finding a certain invariant subspace of a related Hamiltonian matrix. G. Ammar and V. Mehrmann devised a method for calculating this invariant subspace that exploits the Hamiltonian structure of the matrix by using unitary, symplectic similarity transformations. This paper discusses a class of methods that find the invariant subspace by using symplectic similarity transformations that are not necessarily unitary. The method of Ammar and Mehrmann is a special case
AbstractWe discuss some properties of a quadratic matrix equation with some restrictions, then use t...
[[abstract]]An algorithm is presented for solving certain classes of the algebraic Riccati equation ...
AbstractWe present new algorithms for the numerical approximation of eigenvalues and invariant subsp...
AbstractThe algebraic Riccati equation can be solved by finding a certain invariant subspace of a re...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
AbstractA new backward stable, structure preserving method of complexity O(n3) is presented for comp...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
AbstractCharacterizations are given for the Hamiltonian matrices that can be reduced to Hamiltonian ...
This paper addresses some numerical issues that arise in computing a basis for the stable invariant ...
This paper addresses some numerical issues that arise in computing a basis for the stable invariant ...
AbstractA new backward stable, structure preserving method of complexity O(n3) is presented for comp...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
An algorithm to solve continuous-time algebraic Riccati equations through the Hamiltonian Schur form...
AbstractWe discuss some properties of a quadratic matrix equation with some restrictions, then use t...
[[abstract]]An algorithm is presented for solving certain classes of the algebraic Riccati equation ...
AbstractWe present new algorithms for the numerical approximation of eigenvalues and invariant subsp...
AbstractThe algebraic Riccati equation can be solved by finding a certain invariant subspace of a re...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
AbstractA new backward stable, structure preserving method of complexity O(n3) is presented for comp...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
AbstractCharacterizations are given for the Hamiltonian matrices that can be reduced to Hamiltonian ...
This paper addresses some numerical issues that arise in computing a basis for the stable invariant ...
This paper addresses some numerical issues that arise in computing a basis for the stable invariant ...
AbstractA new backward stable, structure preserving method of complexity O(n3) is presented for comp...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
An algorithm to solve continuous-time algebraic Riccati equations through the Hamiltonian Schur form...
AbstractWe discuss some properties of a quadratic matrix equation with some restrictions, then use t...
[[abstract]]An algorithm is presented for solving certain classes of the algebraic Riccati equation ...
AbstractWe present new algorithms for the numerical approximation of eigenvalues and invariant subsp...