Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations
Preprint
Abstract
We describe a procedure based on the Krawczyk method to compute a verified enclosure for the stabilizing solution of a continuous-time algebraic Riccati equation $A^*X+XA+Q=XGX$ building on the work of [B.~Hashemi, \emph{SCAN} 2012] and adding several modifications to the Krawczyk procedure. We show that after these improvements the Krawczyk method reaches results comparable with the current state-of-the-art algorithm [Miyajima, \emph{Jpn. J. Ind. Appl. Math} 2015], and surpasses it in some examples. Moreover, we introduce a new direct method for verification which has a cubic complexity in term of the dimension of $X$, employing a fixed-point formulation of the equation inspired by the ADI procedure. The resulting methods are tested on a number of standard benchmark examples.
Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Fast verified computation for solutions of continuous-time algebraic Riccati equationsJapan Journal of Industrial and Applied Mathematics, 2015
- Computing enclosures for the inverse square root and the sign function of a matrixLinear Algebra and its Applications, 2014
- Verified error bounds for solutions of Sylvester matrix equationsLinear Algebra and its Applications, 2012
- Doubling Algorithms with Permuted Lagrangian Graph BasesSIAM Journal on Matrix Analysis and Applications, 2012
- Numerical Solution of Algebraic Riccati Equations2011
- Verification methods: Rigorous results using floating-point arithmeticActa Numerica, 2010
- Verified Computation of Square Roots of a MatrixSIAM Journal on Matrix Analysis and Applications, 2010
- A numerical method for computing the Hamiltonian Schur formNumerische Mathematik, 2006
- Topics in Matrix Analysis1991
- Iterative solution of the Lyapunov matrix equationApplied Mathematics Letters, 1988