Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Computational & Applied Mathematics |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022012000200008 |
Resumo: | An n × n real matrix P is said to be a generalized reflection matrix if P T = P and P² = I (where P T is the transpose of P). A matrix A ∈ Rn×n is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = P A P (A = - P A P). The reflexive and anti-reflexive matrices have wide applications in many fields. In this article, two iterative algorithms are proposed to solve the coupled matrix equations { A1 XB1 + C1X T D1 = M1. A2 XB2 + C2X T D2 = M2. over reflexive and anti-reflexive matrices, respectively. We prove that the first (second) algorithm converges to the reflexive (anti-reflexive) solution of the coupled matrix equations for any initial reflexive (anti-reflexive) matrix. Finally two numerical examples are used to illustrate the efficiency of the proposed algorithms. Mathematical subject classification: 15A06, 15A24, 65F15, 65F20. |
id |
SBMAC-2_a83a35b10437a28b3ab72f32df7b4b79 |
---|---|
oai_identifier_str |
oai:scielo:S1807-03022012000200008 |
network_acronym_str |
SBMAC-2 |
network_name_str |
Computational & Applied Mathematics |
repository_id_str |
|
spelling |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matricesiterative algorithmmatrix equationreflexive matrixanti-reflexive matrixAn n × n real matrix P is said to be a generalized reflection matrix if P T = P and P² = I (where P T is the transpose of P). A matrix A ∈ Rn×n is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = P A P (A = - P A P). The reflexive and anti-reflexive matrices have wide applications in many fields. In this article, two iterative algorithms are proposed to solve the coupled matrix equations { A1 XB1 + C1X T D1 = M1. A2 XB2 + C2X T D2 = M2. over reflexive and anti-reflexive matrices, respectively. We prove that the first (second) algorithm converges to the reflexive (anti-reflexive) solution of the coupled matrix equations for any initial reflexive (anti-reflexive) matrix. Finally two numerical examples are used to illustrate the efficiency of the proposed algorithms. Mathematical subject classification: 15A06, 15A24, 65F15, 65F20.Sociedade Brasileira de Matemática Aplicada e Computacional2012-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022012000200008Computational & Applied Mathematics v.31 n.2 2012reponame:Computational & Applied Mathematicsinstname:Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)instacron:SBMAC10.1590/S1807-03022012000200008info:eu-repo/semantics/openAccessDehghan,MehdiHajarian,Masoudeng2012-12-05T00:00:00Zoai:scielo:S1807-03022012000200008Revistahttps://www.scielo.br/j/cam/ONGhttps://old.scielo.br/oai/scielo-oai.php||sbmac@sbmac.org.br1807-03022238-3603opendoar:2012-12-05T00:00Computational & Applied Mathematics - Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)false |
dc.title.none.fl_str_mv |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices |
title |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices |
spellingShingle |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices Dehghan,Mehdi iterative algorithm matrix equation reflexive matrix anti-reflexive matrix |
title_short |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices |
title_full |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices |
title_fullStr |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices |
title_full_unstemmed |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices |
title_sort |
Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices |
author |
Dehghan,Mehdi |
author_facet |
Dehghan,Mehdi Hajarian,Masoud |
author_role |
author |
author2 |
Hajarian,Masoud |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Dehghan,Mehdi Hajarian,Masoud |
dc.subject.por.fl_str_mv |
iterative algorithm matrix equation reflexive matrix anti-reflexive matrix |
topic |
iterative algorithm matrix equation reflexive matrix anti-reflexive matrix |
description |
An n × n real matrix P is said to be a generalized reflection matrix if P T = P and P² = I (where P T is the transpose of P). A matrix A ∈ Rn×n is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = P A P (A = - P A P). The reflexive and anti-reflexive matrices have wide applications in many fields. In this article, two iterative algorithms are proposed to solve the coupled matrix equations { A1 XB1 + C1X T D1 = M1. A2 XB2 + C2X T D2 = M2. over reflexive and anti-reflexive matrices, respectively. We prove that the first (second) algorithm converges to the reflexive (anti-reflexive) solution of the coupled matrix equations for any initial reflexive (anti-reflexive) matrix. Finally two numerical examples are used to illustrate the efficiency of the proposed algorithms. Mathematical subject classification: 15A06, 15A24, 65F15, 65F20. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012-01-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022012000200008 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022012000200008 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S1807-03022012000200008 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Matemática Aplicada e Computacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Matemática Aplicada e Computacional |
dc.source.none.fl_str_mv |
Computational & Applied Mathematics v.31 n.2 2012 reponame:Computational & Applied Mathematics instname:Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC) instacron:SBMAC |
instname_str |
Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC) |
instacron_str |
SBMAC |
institution |
SBMAC |
reponame_str |
Computational & Applied Mathematics |
collection |
Computational & Applied Mathematics |
repository.name.fl_str_mv |
Computational & Applied Mathematics - Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC) |
repository.mail.fl_str_mv |
||sbmac@sbmac.org.br |
_version_ |
1754734890471915520 |