Convergence analysis of generalized conjugate direction method to solve general coupled Sylvester discrete‐time periodic matrix equations

DOI10.1002/ACS.2742zbMath1370.93160OpenAlexW2557218148MaRDI QIDQ5364006

Masoud Hajarian

Publication date: 2 October 2017

Published in: International Journal of Adaptive Control and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/acs.2742

zbMATH Keywords

generalized conjugate direction methodfinite number of iterationsgeneral Sylvester discrete-time periodic matrix equations

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Matrix equations and identities (15A24) Control/observation systems governed by ordinary differential equations (93C15)

Related Items (4)

Finite iterative algorithm for the symmetric periodic least squares solutions of a class of periodic Sylvester matrix equations ⋮ Quasi gradient-based inversion-free iterative algorithm for solving a class of the nonlinear matrix equations ⋮ AN ITERATIVE ALGORITHM FOR SOLVING A CLASS OF GENERALIZED COUPLED SYLVESTER-TRANSPOSE MATRIX EQUATIONS OVER BISYMMETRIC OR SKEW-ANTI-SYMMETRIC MATRICES ⋮ Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm

This page was built for publication: Convergence analysis of generalized conjugate direction method to solve general coupled Sylvester discrete‐time periodic matrix equations