2019•Asian Control ConferenceRequires access

Iterative Algorithm to Coupled Matrix Equations and Its Control Application

Caiqin Song, Liying Sun

Open publisher page 0 citations

Abstract

In order to solve the solution to the coupled Sylvester-conjugate transpose matrix equations, we present an iterative algorithm based on the hierarchical identification principle. For any initial values, the iterative solution consistently converges to the exact solution. Moreover, for any initial matrices, sufficient conditions are derived by means of a real representation of a complex matrix. Finally, In order to illustrate the efficiency of the proposed algorithm, control application to iterative algorithm has been presented.

About this research paper

What this paper is about

In order to solve the solution to the coupled Sylvester-conjugate transpose matrix equations, we present an iterative algorithm based on the hierarchical identification principle. For any initial values, the iterative solution consistently converges to the exact solution. Moreover, for any initial matrices, sufficient conditions are derived by means of a real representation of a complex matrix. Finally, In order to illustrate the efficiency of the proposed algorithm, control application to iterative algorithm has been presented.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to solve the solution to the coupled Sylvester-conjugate transpose matrix equations, we present an iterative algorithm based on the hierarchical identification principle. For any initial values, the iterative solution consistently converges to the exact solution. Moreover, for any initial matrices, sufficient conditions are derived by means of a real representation of a complex matrix. Finally, In order to illustrate the efficiency of the proposed algorithm, control application to iterative algorithm has been presented.

Key concepts: Transpose, Iterative method, Algorithm, Matrix-free methods, Matrix (chemical analysis), Sylvester's law of inertia, Computer science, Representation (politics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Iterative Algorithm to Coupled Matrix Equations and Its Control Application — Research Paper | ScholarLens