Search results

It is desired to provide a diversified iterative scheme for solving the constrained solutions of the generalized coupled discrete-time periodic (GCDTP) matrix equations from the perspective of optimization.

The paper considers generalized reflexive solutions of the GCDTP matrix equations by applying the Jacobi gradient-based iterative (JGI) algorithm, which is an extended variant of the gradient-based iterative (GI) algorithm.

Through numerical simulation, it is verified that the efficiency and accuracy of the JGI algorithm are better than some existing algorithms, such as the GI algorithm in Hajarian, the RGI algorithm in Sheng and the AGI algorithm in Xie and Ma.

It is the first instance in which the GCDTP matrix equations are solved applying the JGI algorithm.

The paper aims to study the constraint solutions of the periodic coupled operator matrix equations by the biconjugate residual algorithm. The new algorithm can solve a lot of constraint solutions including Hamiltonian solutions and symmetric solutions, as special cases. At the end of this paper, the new algorithm is applied to the pole assignment problem.

When the studied periodic coupled operator matrix equations are consistent, it is proved that constraint solutions can converge to exact solutions. It is demonstrated that the solutions of the equations can be obtained by the new algorithm with any arbitrary initial matrices without rounding error in a finite number of iterative steps. In addition, the least norm-constrained solutions can also be calculated by selecting any initial matrices when the equations of the periodic coupled operator matrix are inconsistent.

Numerical examples show that compared with some existing algorithms, the proposed method has higher convergence efficiency because less data are used in each iteration and the data is sufficient to complete an update. It not only has the best convergence accuracy but also requires the least running time for iteration, which greatly saves memory space.

Compared with previous algorithms, the main feature of this algorithm is that it can synthesize these equations together to get a coupled operator matrix equation. Although the equation of this paper contains multiple submatrix equations, the algorithm in this paper only needs to use the information of one submatrix equation in the equation of this paper in each iteration so that different constraint solutions of different (coupled) matrix equations can be studied for this class of equations. However, previous articles need to iterate on a specific constraint solution of a matrix equation separately.