Analysis and modificaton of Newton’s method for algebraic Riccati equations
Open Access
- 1 July 1998
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (223) , 1089-1105
- https://doi.org/10.1090/s0025-5718-98-00947-8
Abstract
When Newton’s method is applied to find the maximal symmetric solution of an algebraic Riccati equation, convergence can be guaranteed under moderate conditions. In particular, the initial guess need not be close to the solution. The convergence is quadratic if the Fréchet derivative is invertible at the solution. In this paper we examine the behaviour of the Newton iteration when the derivative is not invertible at the solution. We find that a simple modification can improve the performance of the Newton iteration dramatically.Keywords
This publication has 17 references indexed in Scilit:
- On Hermitian Solutions of the Symmetric Algebraic Riccati EquationSIAM Journal on Control and Optimization, 1986
- A Shamanskii-Like Acceleration Scheme for Nonlinear Equations at Singular RootsMathematics of Computation, 1986
- Monotonicity of maximal solutions of algebraic Riccati equationsSystems & Control Letters, 1985
- An efficient Schur method to solve the stabilizing problemIEEE Transactions on Automatic Control, 1981
- Newton’s Method at Singular Points. ISIAM Journal on Numerical Analysis, 1980
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- Matrix quadratic equationsBulletin of the Australian Mathematical Society, 1974
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972
- Iterative Solution of Nonlinear Equations in Several VariablesMathematics of Computation, 1971
- On an iterative technique for Riccati equation computationsIEEE Transactions on Automatic Control, 1968