Abstract
Continuous algebraic Riccati equations (CARE) appear in several important applications. A suitable approach for solving CARE, in the large-scale case, is to apply Kleinman–Newton’s method which involves the solution of a Lyapunov equation at every inner iteration. Lyapunov equations are linear, nevertheless, solving them requires specialized techniques. Different numerical methods have been designed to solve them, including ADI and Krylov-type iterative projection methods. For these iterative schemes, preconditioning is always a difficult task that can significantly accelerate the convergence. We present and analyze a strategy for solving CARE based on the use of inexact Kleinman–Newton iterations with an implicit preconditioning strategy for solving the Lyapunov equations at each inner step. One advantage is that the Newton direction is approximated implicitly, avoiding the explicit knowledge of the given matrices. Only the effect of the matrix–matrix products with the given matrices is required. We present illustrative numerical experiments on some test problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Antoulas AC (2005) Approximation of large-scale dynamical systems. SIAM, Philadelphia
Bao L, Wei Y, Lin Y (2006) Krylov subspace methods for the generalized Sylvester equation. Appl Math Comput 175:557–573
Benner P, Byers R (1998) An exact line search method for solving generalized continuous-time algebraic Riccati equations. IEEE Trans Automat Control 43:101–107
Benner P, Li J-L, Penzl T (2008a) Numerical solution of large-scale Lyapunov equations, Riccati equations, and linear-quadratic optimal control problems. Numer Linear Algebra Appl 15:755–777
Benner P, Mena H, Saak J (2008b) On the parameter selection problem in the Newton-ADI iteration for large-scale Riccati equations. Electron Trans Numer Anal 29:136–149
Bini DA, Iannazzo B, Meini B (2012) Numerical solution of algebraic Riccati equations. SIAM, Philadelphia
Birgin EG, Martínez JM, Raydan M (2014) Spectral projected gradient methods: review and perspectives. J Stat Softw 60(3)
Bouhamidi A, Jbilou K (2008) A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications. Appl Math Comput 256:687–694
Chehab J-P, Raydan M (2005) Inverse and adaptive preconditioned gradient methods for nonlinear problems. Appl Numer Math 55:32–47
Chehab J-P, Raydan M (2009) Implicitly preconditioned and globalized residual method for solving steady fluid flows. ETNA 34:136–151
Chehab J-P, Raydan M (2011) An implicit preconditioning strategy for large-scale generalized Sylvester equations. Appl Math Comput 217:8793–8803
Damm T (2008) Direct methods and ADI-preconditioned Krylov subspace methods for generalized Lyapunov equations. Numer Linear Algebra Appl 15:853–871
Datta BN (2003) Numerical methods for linear control systems design and analysis. Elsevier Press, Amsterdam
Dembo RS, Eisenstat SC, Steihaug T (1982) Inexact Newton methods. SIAM J Numer Anal 19:400–408
Eisenstat SC, Walker HF (1996) Choosing the forcing terms in inexact Newton method. SIAM J Sci Comput 17:16–32
El Guennouni A, Jbilou K, Riquet AJ (2002) Block Krylov subspace methods for solving large Sylvester equations. Numer Algorithms 29:75–96
Feitzinger F, Hylla T, Sachs EW (2009) Inexact Kleinman–Newton method for Riccati equations. SIAM J Matrix Anal Appl 31:272–288
Guo C-H, Lancaster P (1998) Analysis and modification of Newton’s method for algebraic Riccati equations. Math Comput 67:1089–1105
Hackbruck M, Starke G (1995) Preconditioned Krylov subspace methods for Lyapunov matrix equations. SIAM J Matrix Anal Appl 16:156–171
Heyouni M, Jbilou K (2009) An extended block Arnoldi algorithm for large-scale solutions of the continuous-time algebraic Riccati equation. Electron Trans Numer Anal 33:53–62
Horn RA, Johnson CR (1991) Topics in matrix analysis. Cambridge University Press, Cambridge
Jaimoukha IM, Kasenally EM (1994) Krylov subspace methods for solving large Lyapunov equations. SIAM J Matrix Anal Appl 31:227–251
Jbilou K (2003) Block Krylov subspace methods for large algebraic Riccati equations. Numer Algorithms 34:339–373
Jbilou K (2006) An Arnoldi based algorithm for large algebraic Riccati equations. Appl Math Lett 19:437–474
Jbilou K (2010) ADI preconditioned Krylov methods for large Lyapunov matrix equations. Linear Algebra Appl 432:2473–2485
Jbilou K, Riquet A (2006) Projection methods for large Lyapunov matrix equations. Linear Algebra Appl 415:344–358
Kleinman D (1968) On an iterative technique for Riccati equation computations. IEEE Trans Automat Control 13:114–115
La Cruz W, Martínez JM, Raydan M (2006) Spectral residual method without gradient information for solving large-scale nonlinear systems. Math Comput 75:1449–1466
Lancaster P, Rodman L (1995) The algebraic Riccati equation. Oxford University Press, Oxford
Mehrmann V (1991) The autonomous linear quadratic control problem, theory and numerical solution, Lecture Notes in Control and Information Sciences, 163. Springer, Berlin
Sandell NR (1974) On Newton’s method for Riccati equation solution. IEEE Trans Automat Control 19:254–255
Simoncini V, Szyld DB, Monsalve M (2014) On two numerical methods for the solution of large-scale algebraic Riccati equations. IMA J Numer Anal 34:904–920
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Jinyun Yuan.
Marcos Raydan: Partially supported by CCCT Center at UCV.
Rights and permissions
About this article
Cite this article
Chehab, JP., Raydan, M. Inexact Newton’s method with inner implicit preconditioning for algebraic Riccati equations. Comp. Appl. Math. 36, 955–969 (2017). https://doi.org/10.1007/s40314-015-0274-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40314-015-0274-8