On the solutions to Sylvester‐conjugate periodic matrix equations via iteration
Lei Zhang, Pengxiang Li, Mengqi Han and 3 more
IET Control Theory & Applications · 2023
doi:10.1049/cth2.12312 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Abstract The problem of solving a class of Sylvester‐conjugate periodic matrix equations is investigated in this paper. Utilising conjugate gradient method, an iterative algorithm is provided, from which a matrix sequence can be generated to approximate the unknown matrix of the equation to be solved. Theoretical derivation proves that the proposed algorithm is convergent starting from any initial value, and simulation examples show the effectiveness of the proposed algorithm.
Abstract licence: CC BY-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.