We present a new numerical method (based on the computation of deflating subspaces) for the γ-iteration in H∞ control in the extended matrix pencil formulation. We introduce a permuted graph representation of these subspaces, which avoids the known difficulties that arise when the iteration is based on the solution of algebraic Riccati equations but at the same time makes use of the special symmetry structures that are present in the problems. We use this representation to perform both the deflation of spurious ∞ eigenvalues of the even pencils and the implementation of the inverse-free sign iteration. We show that the new method returns accurate results and is applicable in many situations where conventional methods fail. © 2013 Elsevier L...
Abstract. We discuss the numerical solution of structured generalized eigenvalue problems that arise...
AbstractIn this article, we will study the link between a method for computing eigenvalues closest t...
We present a class of fast subspace algorithms based on orthogonal iterations for structured matrice...
AbstractWe present a numerical method for the solution of the optimal H∞ control problem based on th...
We present a new numerical method for the γ-iteration in robust control based on the extended matrix...
The 2-Riccati H∞ controller formulas and derivations are simplified via various 'loop-shifting' tran...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
We introduce a numerical method for the numerical solution of the Lur'e equations, a system of matri...
A permuted graph matrix is a matrix V ∈ C(m+n)×m such that every row of the m × m identity matrix Im...
This chapter concerns the treatment of the most recent and advanced algorithms for solving algebraic...
Abstract. We investigate the eect of linear perturbations on several structured matrix pencils arisi...
. In this paper we present modified algorithms for computing deflating subspaces of matrix pencils b...
[[abstract]]We develop an algorithm for the deflation of the invariant subspace corresponding to inf...
In this article, we will study the link between a method for computing eigenvalues closest to the im...
AbstractWe develop an algorithm for the deflation of the invariant subspace corresponding to infinit...
Abstract. We discuss the numerical solution of structured generalized eigenvalue problems that arise...
AbstractIn this article, we will study the link between a method for computing eigenvalues closest t...
We present a class of fast subspace algorithms based on orthogonal iterations for structured matrice...
AbstractWe present a numerical method for the solution of the optimal H∞ control problem based on th...
We present a new numerical method for the γ-iteration in robust control based on the extended matrix...
The 2-Riccati H∞ controller formulas and derivations are simplified via various 'loop-shifting' tran...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
We introduce a numerical method for the numerical solution of the Lur'e equations, a system of matri...
A permuted graph matrix is a matrix V ∈ C(m+n)×m such that every row of the m × m identity matrix Im...
This chapter concerns the treatment of the most recent and advanced algorithms for solving algebraic...
Abstract. We investigate the eect of linear perturbations on several structured matrix pencils arisi...
. In this paper we present modified algorithms for computing deflating subspaces of matrix pencils b...
[[abstract]]We develop an algorithm for the deflation of the invariant subspace corresponding to inf...
In this article, we will study the link between a method for computing eigenvalues closest to the im...
AbstractWe develop an algorithm for the deflation of the invariant subspace corresponding to infinit...
Abstract. We discuss the numerical solution of structured generalized eigenvalue problems that arise...
AbstractIn this article, we will study the link between a method for computing eigenvalues closest t...
We present a class of fast subspace algorithms based on orthogonal iterations for structured matrice...