Recursive Algorithms for Solving a Class of Nonlinear Matrix Equations with Applications to Certain Sensitivity Optimization Problems

DOI10.1137/S0363012992226855zbMath0808.93026MaRDI QIDQ4315362

John B. Moore, Wei-Yong Yan, Uwe R. Helmke

Publication date: 8 December 1994

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

zbMATH Keywords

recursive algorithmsmatrix difference equations\(L^ 2\)-sensitivity optimal realizationbalancing realizationsnonlinear algebraic matrix equations

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Matrix equations and identities (15A24) Minimal systems representations (93B20) Additive difference equations (39A10)

Related Items

On the existence of a positive definite solution of the matrix equation, Minimum sensitivity realizations of networks of linear systems, A Jacobi-type method for computing balanced realizations, The constrained Newton method on a Lie group and the symmetric eigenvalue problem, Some properties for the existence of a positive definite solution of matrix equation \(X+A^*X^{-2^m}A=I\), Newton's method for concave operators with resolvent positive derivatives in ordered Banach spaces