Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices

15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

An n × n real matrix P is said to be a generalized reflection matrix if PT = P and P2 = I (where PT is the transpose of P). A matrix A ∈ Rn×n is said to be a reflexive (antireflexive)matrix with respect to the generalized reflection matrix P if A = PAP (A = -PAP).The reflexive and anti-reflexive matrices have wide applications in many fields. In this article,two iterative algorithms are proposed to solve the coupled matrixequations over reflexive and anti-reflexive matrices, respectively. We prove that the first (second) algorithm converges to the reflexive (anti-reflexive) solution of the coupled matrixequations for any initial reflexive (anti-reflexive) matrix. Finally two numerical examples are used to illustrate the efficiency of the proposed algorithms. © 2012 SBMAC.

Cite

CITATION STYLE

APA

Dehghan, mehdi, & Hajarian, masoud. (2012). Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices. Computational and Applied Mathematics. Springer Science and Business Media, LLC. https://doi.org/10.1590/S1807-03022012000200008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free