Summary.Solutions of symmetric Riccati differential equations (RDEs for short) are in the usual applications positive semidefinite matrices. Moreover, in the class of semidefinite matrices, solutions of different RDEs are also monotone, with respect to properly ordered data. Positivity and monotonicity are essential properties of RDEs. In Dieci and Eirola (1994), we showed that, generally, a direct discretization of the RDE cannot maintain positivity, and be of order greater than one. To get higher order, and to maintain positivity, we are thus forced to look into indirect solution procedures. Here, we consider the problem of how to maintain monotonicity in the numerical solutions of RDEs. Naturally, to obtain order greater than one, we are again forced to look into indirect solution procedures. Still, the restrictions imposed by monotonicity are more stringent that those of positivity, and not all of the successful indirect solution procedures of Dieci and Eirola (1994) maintain monotonicity. We prove that by using symplectic Runge-Kutta (RK) schemes with positive weights (e.g., Gauss schemes) on the underlying Hamiltonian matrix, we eventually maintain monotonicity in the computed solutions of RDEs.
[1]
J. M. Sanz-Serna,et al.
Symplectic integrators for Hamiltonian problems: an overview
,
1992,
Acta Numerica.
[2]
L. Dieci,et al.
Positive definiteness in the numerical solution of Riccati
differential equations
,
1994
.
[3]
Timo Eirola.
Monotonicity of quadratic forms with symplectic Runge-Kutta methods
,
1995
.
[4]
M. Ikeda,et al.
Stabilization of Linear Systems
,
1972
.
[5]
B. Anderson,et al.
Linear Optimal Control
,
1971
.
[6]
Huibert Kwakernaak,et al.
Linear Optimal Control Systems
,
1972
.
[7]
R. E. Kalman,et al.
Contributions to the Theory of Optimal Control
,
1960
.