2017
DOI: 10.3934/jimo.2016036
|View full text |Cite
|
Sign up to set email alerts
|

Parametric solutions to the regulator-conjugate matrix equations

Abstract: The problem of solving regulator-conjugate matrix equations is considered in this paper. The regulator-conjugate matrix equations are a class of nonhomogeneous equations. Utilizing several complex matrix operations and the concepts of controllability-like and observability-like matrices, a special solution to this problem is constructed, which includes solving an ordinary algebraic matrix. Combined with our recent results on Sylvester-conjugate matrix equations, complete solutions to regulator-conjugate matrix… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…One can see some related works in refs. [13][14][15][16][17][18][19][20] and the references therein. The linear periodic system with time-varying state and input dimensions has also attracted the research interest of scholars in the recent years.…”
Section: Introductionmentioning
confidence: 99%
“…One can see some related works in refs. [13][14][15][16][17][18][19][20] and the references therein. The linear periodic system with time-varying state and input dimensions has also attracted the research interest of scholars in the recent years.…”
Section: Introductionmentioning
confidence: 99%
“…By constructing an objective function and using the gradient search, a gradient-based iteration is established in [9] for solving the coupled matrix equations A i XB i = F i , i = 1, 2, ..., p. By using the hierarchical identification principle and introducing the convergence factor and the iterative matrix, a family of inversion-free iterative algorithms is proposed in [24] for solving nonlinear matrix equations X + A T X −1 A = I. M. Dehghan and M. Hajarian proposed some iterative algorithms based on the conjugate gradient (CG) method for solving the system of generalized Sylvester matrix equations( [5]), coupled Sylvester matrix equations( [6]) and the second-order Sylvester matrix equation EV F 2 − AV F 2 − CV = BW ( [7]), which are applications of CG in the area of solving time-invariant matrix equations. There are still many papers that are available for reference(one can see [25,15,1,2,3,17,18,20,21]).…”
mentioning
confidence: 99%