Name
Title | ||
|---|---|---|
A finite iterative algorithm for the general discrete-time periodic Sylvester matrix equations |
Abstract | ||
|---|---|---|
The purpose of this paper is to present an iterative algorithm for solving the general discrete-time periodic Sylvester matrix equations. It is proved by theoretical analysis that this algorithm can get the exact solutions of the periodic Sylvester matrix equations in a finite number of steps in the absence of round-off errors. Furthermore, when the discrete-time periodic Sylvester matrix equations are consistent, we can obtain its unique minimal Frobenius norm solution by choosing appropriate initial periodic matrices. Finally, we use some numerical examples to illustrate the effectiveness of the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.jfranklin.2022.03.047 | Journal of the Franklin Institute |
DocType | Volume | Issue |
Journal | 359 | 9 |
ISSN | Citations | PageRank |
0016-0032 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Changfeng Ma | 1 | 197 | 29.63 |
| Tongxin Yan | 2 | 0 | 0.34 |