A subspace shift technique for nonsymmetric algebraic Riccati equations associated with an M-matrix

作者：Iannazzo Bruno^*; Poloni Federico

来源：Numerical Linear Algebra with Applications, 2013, 20(3): 440-452.

DOI：10.1002/nla.1836

• nonsymmetric algebraic Riccati equation
• fluid queue
• structured doubling algorithm
• shift technique
• subspace separation
• invariant subspace
• M-matrix

The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M-matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive and one with negative real part. When both eigenvalues are exactly zero, the problem is called critical or null recurrent. Although in this case the problem is ill-conditioned and the convergence of the algorithms based on matrix iterations is slow, there exist some techniques to remove the singularity and transform the problem to a well-behaved one. Ill-conditioning and slow convergence appear also in close-to-critical problems, but when none of the eigenvalues is exactly zero, the techniques used for the critical case cannot be applied. In this paper, we introduce a new method to accelerate the convergence properties of the iterations also in close-to-critical cases, by working on the invariant subspace associated with the problematic eigenvalues as a whole. We present numerical experiments that confirm the efficiency of the new method.

• 出版日期2013-5