...
首页> 外文期刊>Transactions of the Institute of Measurement and Control >Solving the system of linear operator equations over generalized bisymmetric matrices
【24h】

Solving the system of linear operator equations over generalized bisymmetric matrices

机译:广义双对称矩阵上线性算子方程组的求解

获取原文
获取原文并翻译 | 示例
           

摘要

This paper proposes an iterative method based on the conjugate gradient method on the normal equations for finding the generalized bisymmetric solution X to the system of linear operator equations A_1(X) = C_1, A_2(X) = C_2, .. .. .. A_l(X) = C_l where A_1, A_2,...,A_l are linear operators. By the iterative method, the solvability of this system over the generalized bisymmetric matrix X can be determined automatically. When the system of linear operator equations is consistent over the generalized bisymmetric matrix X, the iterative method with any generalized bisymmetric initial iterative matrix X(1) can compute the generalized bisymmetric solution within a finite number of iterations in the absence of roundoff errors. In addition, by the proposed iterative method, the least Frobenius norm generalized bisymmetric solution can be derived when a special initial generalized bisymmetric matrix is chosen. Finally, two numerical examples are presented to support the theoretical results of this paper.
机译:本文针对正则方程提出了一种基于共轭梯度法的迭代方法,用于找到线性算子方程A_1(X)= C_1,A_2(X)= C_2,.....的广义双对称解X。 A_1(X)= C_1,其中A_1,A_2,...,A_1是线性算子。通过迭代方法,可以自动确定该系统在广义双对称矩阵X上的可解性。当线性算子方程组的系统在广义双对称矩阵X上是一致的时,具有任何广义双对称初始迭代矩阵X(1)的迭代方法都可以在不存在舍入误差的情况下,在有限的迭代次数内计算广义双对称解。此外,通过提出的迭代方法,当选择特殊的初始广义双对称矩阵时,可以导出最小Frobenius范数广义双对称解。最后,给出了两个数值例子来支持本文的理论结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号