基于梯度的复共轭矩阵与转置矩阵耦合迭代算法

H. Yin, Huamin Zhang
{"title":"基于梯度的复共轭矩阵与转置矩阵耦合迭代算法","authors":"H. Yin, Huamin Zhang","doi":"10.4236/alamt.2021.113007","DOIUrl":null,"url":null,"abstract":"Gradient-based iterative algorithm is suggested for solving a coupled complex conjugate and transpose matrix equations. Using the hierarchical identification principle and the real representation of a complex matrix, a convergence proof is offered. The necessary and sufficient conditions for the optimal convergence factor are determined. A numerical example is offered to validate the efficacy of the suggested algorithm.","PeriodicalId":65610,"journal":{"name":"线性代数与矩阵理论研究进展(英文)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Gradient-Based Iterative Algorithm for a Coupled Complex Conjugate and Transpose Matrix Equations\",\"authors\":\"H. Yin, Huamin Zhang\",\"doi\":\"10.4236/alamt.2021.113007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Gradient-based iterative algorithm is suggested for solving a coupled complex conjugate and transpose matrix equations. Using the hierarchical identification principle and the real representation of a complex matrix, a convergence proof is offered. The necessary and sufficient conditions for the optimal convergence factor are determined. A numerical example is offered to validate the efficacy of the suggested algorithm.\",\"PeriodicalId\":65610,\"journal\":{\"name\":\"线性代数与矩阵理论研究进展(英文)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"线性代数与矩阵理论研究进展(英文)\",\"FirstCategoryId\":\"1089\",\"ListUrlMain\":\"https://doi.org/10.4236/alamt.2021.113007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"线性代数与矩阵理论研究进展(英文)","FirstCategoryId":"1089","ListUrlMain":"https://doi.org/10.4236/alamt.2021.113007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种求解共轭矩阵和转置矩阵耦合复方程的梯度迭代算法。利用层次辨识原理和复矩阵的实数表示,给出了收敛性证明。确定了最优收敛因子的充分必要条件。最后通过一个算例验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Gradient-Based Iterative Algorithm for a Coupled Complex Conjugate and Transpose Matrix Equations
Gradient-based iterative algorithm is suggested for solving a coupled complex conjugate and transpose matrix equations. Using the hierarchical identification principle and the real representation of a complex matrix, a convergence proof is offered. The necessary and sufficient conditions for the optimal convergence factor are determined. A numerical example is offered to validate the efficacy of the suggested algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
56
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信