Flexible fixed-point iteration and its applications for nonsymmetric algebraic Riccati equations

In this paper, we reveal the intrinsic Toeplitz structure in the unique stabilizing solution for nonsymmetric algebraic Riccati equations by employing a shift-involved fixed-point iteration, and propose an RADI-type method for computing this solution for large-scale equations of this type with sparse and low-rank structure by incorporating flexible shifts into the fixed-point iteration. We present a shift-selection strategy, termed Leja shifts, based on rational approximation theory, which is incorporated into the RADI-type method. We further discuss important implementation aspects for the method, such as low-rank factorization of residuals, implicit update of large-scale sparse matrices, real arithmetics with complex shifts, and related equations of other type. Numerical experiments demonstrate the efficiency of both the proposed method and the introduced shift-selection strategy.