Extensions to the Bartels-Stewart algorithm for linear matrix equations

DOI10.1109/TAC.1978.1101681MaRDI QIDQ4146214zbMATH OpenFDO

Authors David L. Kleinman, P. Krishna Rao

Publication date 1978

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1978.1101681

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cited in

(10)

• Accelerating noise-tolerant zeroing neural network with fixed-time convergence to solve the time-varying Sylvester equation
• On matrix equations \(X - AXF = C\) and \(X - A\overline{X}F = C\)
• A parameter optimization approach to the design of structurally constrained regulators for discrete-time systems
• 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
• Closed-form solutions to Sylvester-conjugate matrix equations
• Discrete gradient-zeroing neural network algorithm for solving future Sylvester equation aided with left-right four-step rule as well as robot arm inverse kinematics
• On solutions of the matrix equations \(XF - AX = C\) and \(XF - A\bar {X} =C\)
• 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

This page was built for publication: Extensions to the Bartels-Stewart algorithm for linear matrix equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146214)