AN ITERATIVE ALGORITHM FOR SOLVING A CLASS OF GENERALIZED COUPLED SYLVESTER-TRANSPOSE MATRIX EQUATIONS OVER BISYMMETRIC OR SKEW-ANTI-SYMMETRIC MATRICES | Zendy

Changfeng Ma | Zendy; Tongxin Yan | Zendy

Open Access

AN ITERATIVE ALGORITHM FOR SOLVING A CLASS OF GENERALIZED COUPLED SYLVESTER-TRANSPOSE MATRIX EQUATIONS OVER BISYMMETRIC OR SKEW-ANTI-SYMMETRIC MATRICES

Author(s) -

Changfeng Ma,

Tongxin Yan

Publication year - 2020

Publication title -

journal of applied analysis and computation

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.55

H-Index - 21

eISSN - 2158-5644

pISSN - 2156-907X

DOI - 10.11948/20190184

Subject(s) - transpose , mathematics , sylvester's law of inertia , sylvester matrix , skew symmetric matrix , gaussian elimination , class (philosophy) , algebra over a field , matrix (chemical analysis) , pure mathematics , algorithm , symmetric matrix , mathematical analysis , computer science , square matrix , matrix polynomial , gaussian , polynomial matrix , artificial intelligence , eigenvalues and eigenvectors , physics , materials science , quantum mechanics , polynomial , composite material

This paper presents an iterative algorithm to solve a class of generalized coupled Sylvester-transpose matrix equations over bisymmetric or skew-anti-symmetric matrices. When the matrix equations are consistent, the bisymmetric or skew-anti-symmetric solutions can be obtained within finite iteration steps in the absence of round-off errors for any initial bisymmetric or skew-anti-symmetric matrices by the proposed iterative algorithm. In addition, we can obtain the least norm solution by choosing the special initial matrices. Finally, numerical examples are given to demonstrate the iterative algorithm is quite efficient. The merit of our method is that it is easy to implement.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research