Efficient iterative method for solving the second-order Sylvester matrix equation EVF 2 − AVF − CV = BW
Mehdi Dehghan, Masoud Hajarian
Abstract
Mehdi Dehghan, Masoud Hajarian
Abstract
The second-order Sylvester matrix equation EVF2−AVF−CV=BW (including the generalised Sylvester matrix equation, normal Sylvester matrix equation and Lyapunov matrix equation as special cases) over unknown matrix pair [V, W], has wide applications in many fields. In the present study, the authors propose an iterative method to solve the second-order Sylvester matrix equation. The proposed iterative method does not depend on the Jordan form of the matrix F. By this iterative method, the solvability of the matrix equation can be determined automatically over unknown matrix pair [V, W]≠0. When the matrix equation is solvable, its solution pair can be obtained within finite iterative steps, and its least Frobenius norm solution pair can be obtained by choosing suitable initial matrix pair. Furthermore, its optimal approximation solution pair to a given matrix pair can be derived by finding the least norm solution pair of a new matrix equation. A numerical example is given to show the efficiency of the proposed method.
OpenAlex reports 74 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The second-order Sylvester matrix equation EVF2−AVF−CV=BW (including the generalised Sylvester matrix equation, normal Sylvester matrix equation and Lyapunov matrix equation as special cases) over unknown matrix pair [V, W], has wide applications in many fields. In the present study, the authors propose an iterative method to solve the second-order Sylvester matrix equation. The proposed iterative method does not depend on the Jordan form of the matrix F. By this iterative method, the solvability of the matrix equation can be determined automatically over unknown matrix pair [V, W]≠0. When the matrix equation is solvable, its solution pair can be obtained within finite iterative steps, and its least Frobenius norm solution pair can be obtained by choosing suitable initial matrix pair. Furthermore, its optimal approximation solution pair to a given matrix pair can be derived by finding the least norm solution pair of a new matrix equation. A numerical example is given to show the efficiency of the proposed method.
Key concepts: Sylvester equation, Sylvester matrix, Mathematics, Matrix (chemical analysis), Sylvester's law of inertia, Matrix difference equation, Matrix differential equation, Iterative method