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
AbstractA new backward stable, structure preserving method of complexity O(n3) is presented for comp...
[[abstract]]An algorithm is presented for solving certain classes of the algebraic Riccati equation ...
The numerical solution of an algebraic Riccati equation can be reduced to the computation of an inva...
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...
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...
An algorithm to solve continuous-time algebraic Riccati equations through the Hamiltonian Schur form...
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...
AbstractCharacterizations are given for the Hamiltonian matrices that can be reduced to Hamiltonian ...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
We use a second-order learning algorithm for numerically solving a class of the algebraic Riccati eq...
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...
[[abstract]]An algorithm is presented for solving certain classes of the algebraic Riccati equation ...
The numerical solution of an algebraic Riccati equation can be reduced to the computation of an inva...
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...
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...
An algorithm to solve continuous-time algebraic Riccati equations through the Hamiltonian Schur form...
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...
AbstractCharacterizations are given for the Hamiltonian matrices that can be reduced to Hamiltonian ...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
We use a second-order learning algorithm for numerically solving a class of the algebraic Riccati eq...
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...
[[abstract]]An algorithm is presented for solving certain classes of the algebraic Riccati equation ...
The numerical solution of an algebraic Riccati equation can be reduced to the computation of an inva...