Answers are grounded in this paper and cite their sources.
Newton iteration method can be used to find the minimal non-negative solution of a certain class of non-symmetric algebraic Riccati equations. However, a serious bottleneck exists in efficiency and storage for the implementation of the Newton iteration method, which comes from the use of some direct methods in exactly solving the involved Sylvester equations. In this paper, instead of direct methods, we apply a fast doubling iteration scheme to inexactly solve the Sylvester equations. Hence, a class of inexact Newton iteration methods that uses the Newton iteration method as the outer iteration and the doubling iteration scheme as the inner iteration is obtained. The corresponding procedure is precisely described and two practical methods of monotone convergence are algorithmically presented. In addition, the convergence property of these new methods is studied and numerical results are given to show their feasibility and effectiveness for solving the non-symmetric algebraic Riccati equations.
No takes yet. Share an insight, caveat, or question.
Gao et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: