The BCR algorithms for solving the reflexive or anti-reflexive solutions of generalized coupled Sylvester matrix equations

被引:21
|
作者
Yan, Tongxin [1 ,2 ]
Ma, Changfeng [1 ]
机构
[1] Fujian Normal Univ, Coll Math & Informat & FJKLMAA, Fuzhou 350117, Peoples R China
[2] Fujian Univ Technol, Sch Comp Sci & Math, Fuzhou 350118, Peoples R China
来源
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS | 2020年 / 357卷 / 17期
关键词
FINITE ITERATIVE ALGORITHMS; OPTIMAL APPROXIMATION SOLUTION; SYMMETRIC-SOLUTIONS; SUBMATRIX CONSTRAINT; LINEAR MATRIX; SYSTEMS; AXB; VERSION;
D O I
10.1016/j.jfranklin.2020.09.030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes the Lanczos version of the biconjugate residual algorithm to solve the reflexive or anti-reflexive solutions of a class of generalized coupled Sylvester matrix equations. We give a convergence analysis, and by constructing a special form of the initial matrices, the minimum-norm reflexive solutions can be obtained through finite-step iterations without considering rounding errors. At the end of the paper, we provide numerical examples to illustrate the feasibility and effectiveness of this algorithm. (C) 2020 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:12787 / 12807
页数:21
相关论文
共 50 条