Partitioned Ricatti solutions and integration-free doubling algorithms

Generalized partitioned solutions (GPS) of Riccati equations (RE) are presented in terms of forward and backward time differential equations that are theoretically interesting, possibly computationally advantageous, as well as provide interesting interpretations of these resuits, e.g., in terms of generalized partial observability and controllability matrices. The GPS are the natural framework for the effective change of initial conditions, and the transformation of backward RE to forward RE and vice-versa. The GPS are given in terms of families of forward or backward RE, and constitute generalizations to time-varying RE of well-known solution algorithms such as the X - Y or Chandrasekhar algorithms. Most importantly, based on the GPS, computationally effective algorithms are obtained for the numerical solution of RE. These partitioned numerical algorithms (PNA) have a decomposed or "partitioned" structure, namely, they are given exactly in terms of a set of elemental solutions which are completely decoupled, and as such computable in either a parallel or serial processing mode. Further, the overall solution is given exactly in terms of a simple recursive operation on the elemental solutions. Finally, the PNA for a large class of RE, namely those with periodic or constant matrices, are completely integration-free, other than for a subinterval of the total computation interval, whose length, moreover, can be chosen arbitrarily. Also based on the GPS, a computationally attractive numerical algorithm is obtained for the computation of the steady-state solution of time-invariant RE. This algorithm results from doubling the length of the partitioning interval, and straightforward use of the GPS. The resulting "doubling" PNA is fast and is also essentially, integration-free requiring integration only in an initial subinterval, whose length is arbitrary, and subsequently consisting of simple iterative operations at the end of each time-interval which is twice as long as the interval in the previous iterations, i.e., doubling.

[1]  D. Lainiotis,et al.  Partitioning: A unifying framework for adaptive systems, I: Estimation , 1976, Proceedings of the IEEE.

[2]  D. Lainiotis.  Optimal linear smoothing : Continuous data case † , 1973 .

[3]  J. Potter,et al.  A prefiltering version of the Kalman filter with new numerical integration formulas for Riccati equations , 1973, CDC 1973.

[4]  L. Ljung,et al.  Scattering theory and linear least squares estimation—Part I: Continuous-time problems , 1976, Proceedings of the IEEE.

[5]  Demetrios G. Lainiotis,et al.  A unifying framework for linear estimation: Generalized partitioned algorithms , 1976, Inf. Sci..

[6]  W. Reid,et al.  Riccati Differential Equations , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  A numerical method for coupled differential equations , 1972 .

[8]  D. Lainiotis.  Optimal non-linear estimation† , 1971 .

[9]  John L. Casti,et al.  A new initial-value method for on-line filtering and estimation (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[10]  Demetrios Lainiotis,et al.  A unifying approach to linear estimation via the partitioned algorithms, I: Continuous models , 1975, 1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes.

[11]  R. E. Kalman,et al.  New Results in Linear Filtering and Prediction Theory , 1961 .

[12]  Demetrios G. Lainiotis,et al.  Partitioned estimation algorithms, I: Nonlinear estimation , 1974, Inf. Sci..

[13]  D. Lainiotis.  Partitioned estimation algorithms, II: Linear estimation , 1974, CDC 1974.

[14]  D. Lainiotis,et al.  Partitioned Riccati algorithms , 1975, 1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes.

[15]  B. Anderson,et al.  Iterative method of computing the limiting solution of the matrix Riccati differential equation , 1972 .

[16]  T. Kailath.  Some Chandrasekhar-type algorithms for quadratic regulators , 1972, CDC 1972.

[17]  A comparison of computational methods for solving the algebraic matrix Riccati equation , 1971, CDC 1971.

[18]  D. Lainiotis.  Optimal nonlinear estimation , 1971, CDC 1971.

[19]  TERRY L. HENDERSON,et al.  Application of state-variable techniques to optimal feature extraction - Multichannel analog data , 1970, IEEE Trans. Inf. Theory.

[20]  A. Lindquist.  Optimal Filtering of Continuous-Time Stationary Processes by Means of the Backward Innovation Process , 1974 .

[21]  Arthur E. Bryson,et al.  Applied Optimal Control , 1969 .

[22]  D. Lainiotis.  Fast Riccati equation solutions: Partitioned algorithms☆ , 1975 .

[23]  Edward J. Davison,et al.  The numerical solution of the matrix Riccati differential equation , 1973 .

[24]  J. Cruz,et al.  On the solution of the open-loop Nash Riccati equations in linear quadratic differential games† , 1973 .

[25]  Robert F. Brammer,et al.  A note on the use of Chandrasekhar equations for the calculation of the Kalman gain matrix (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[26]  D. G. Lainiotis,et al.  Application of state variable techniques to optimal feature extraction , 1968 .

[27]  J. Hansen.  Radiative transfer by doubling very thin layers , 1969 .

[28]  E Tse,et al.  Optimal linear filtering theory and radiative transfer: Comparisons and interconnections , 1972 .

[29]  D. Kleinman.  On an iterative technique for Riccati equation computations , 1968 .

[30]  J. Potter.  Matrix Quadratic Solutions , 1966 .

[31]  Thomas Kailath,et al.  Some new algorithms for recursive estimation in constant linear systems , 1973, IEEE Trans. Inf. Theory.

[32]  Arthur B. Baggeroer,et al.  A state-variable approach to the solution of Fredholm integral equations , 1969, IEEE Trans. Inf. Theory.

[33]  Alan Schumitzky,et al.  On the Equivalence between Matrix Riccati Equations and Fredholm Resolvents , 1968, J. Comput. Syst. Sci..