Extensions to the Bartels-Stewart algorithm for linear matrix equations
From MaRDI portal
Publication:4146214
DOI10.1109/TAC.1978.1101681zbMath0369.65005MaRDI QIDQ4146214
David L. Kleinman, P. Krishna Rao
Publication date: 1978
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Related Items (9)
On matrix equations \(X - AXF = C\) and \(X - A\overline{X}F = C\) ⋮ On solutions of the matrix equations \(XF - AX = C\) and \(XF - A\bar {X} =C\) ⋮ Closed-form solutions to Sylvester-conjugate matrix equations ⋮ Fresh look into the design and computation of optimal output feedback controls for linear multivariable systems ⋮ Newton's method for solving parametric linear quadratic control problems ⋮ On solutions of matrix equations \(V - AVF = BW\) and \(V-A\bar V F= BW\) ⋮ An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices ⋮ Accelerating noise-tolerant zeroing neural network with fixed-time convergence to solve the time-varying Sylvester equation ⋮ A parameter optimization approach to the design of structurally constrained regulators for discrete-time systems
This page was built for publication: Extensions to the Bartels-Stewart algorithm for linear matrix equations
