1990
DOI: 10.1007/bf02551369
|View full text |Cite
|
Sign up to set email alerts
|

Error bounds for Newton refinement of solutions to algebraic riccati equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
13
0

Year Published

1991
1991
2017
2017

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 31 publications
(14 citation statements)
references
References 16 publications
1
13
0
Order By: Relevance
“…A standard reference for numerical algorithms for solving the algebraic Riccati equation is the work of Laub [108]. We also mention more recent work by Kenney, Laub and Wette [98], and Laub and Gahinet [109].…”
Section: Notes and Referencesmentioning
confidence: 99%
See 1 more Smart Citation
“…A standard reference for numerical algorithms for solving the algebraic Riccati equation is the work of Laub [108]. We also mention more recent work by Kenney, Laub and Wette [98], and Laub and Gahinet [109].…”
Section: Notes and Referencesmentioning
confidence: 99%
“…We refer to Roberts [154] and Byers [26]. For solving Riccati equations we also mention more recent work by Kenney, Laub and Wette [98] and Laub and Gahinet [109].…”
Section: Notes and Referencesmentioning
confidence: 99%
“…With respect to rounding and truncation errors, the sign function has been found to often work just as well as invariant subspace techniques, but it can be shown that occasionally ill-conditioned sign iterations will cause numerical instability ( [52], [53]), and with intermediate low order approximations, such numerical difficulties are even more prominent. Hence we cannot 'solve' the Lyapunov and Riccati equations; there will always be non-zero residuals, , , the norms of which are not necessarily a good measure of the backwards error [54], [55], and the suggested criteria are not easily calculable using SSS methods. Furthermore, due to the potential fragility of optimal controllers [56] it is not acceptable to blindly use an approximated controller and assume that it will have the expected closed loop stability and performance; some kind of closed loop test is needed.…”
Section: B Numerical Issues Relating To the Approximationsmentioning
confidence: 99%
“…Chen [3] has derived global perturbation bounds for the solution, and Xu [18] has improved and sharped Chen's results. Kenney, Laub and Wette [7] have derived residual error bounds associated with Newton refinement of approximate solutions. Ghavimi and Laub [4] have presented a new backward error criterion, together with a sensitivity measure, for assessing solution accuracy of the ARE (1.1).…”
Section: Introductionmentioning
confidence: 99%
“…An important problem is: How near isX to the exact solution X ? Kenney, Laub and Wette [7] have studied the real ARE (1.1) (i.e., the matrices of (1.1) are in R n×n , the set of real n × n matrices), and proved the following result: …”
Section: Introductionmentioning
confidence: 99%