首页> 外文会议>2010 International Conference on Computational Intelligence and Software Engineering >A Matrix-Form LSQR Iterative Method for Solving the Second-Order Sylvester Matrix Equation EXF2+AXF+CX+BY=D
【24h】

A Matrix-Form LSQR Iterative Method for Solving the Second-Order Sylvester Matrix Equation EXF2+AXF+CX+BY=D

机译:求解二阶Sylvester矩阵方程EXF2 + AXF + CX + BY = D的矩阵形式LSQR迭代方法

获取原文

摘要

In this paper, an iterative method is proposed to solve the second-order Sylvester matrix equation EXF^{2}+AXF+CX+BY=D with unknown matrix pair [X, Y], based on a matrix form of LSQR algorithm. By this iterative method, we can obtain the minimum Frobenius norm solution pair or the minimum Frobenius norm least squares solution pair over some constrained matrices, such as symmetric, generalized bisymmetric and (R, S)-symmetric matrices.
机译:本文基于LSQR算法的矩阵形式,提出了一种求解未知矩阵对[X,Y]的二阶Sylvester矩阵方程EXF ^ {2} + AXF + CX + BY = D的迭代方法。通过这种迭代方法,我们可以在某些约束矩阵(例如对称矩阵,广义双对称矩阵和(R,S)对称矩阵)上获得最小Frobenius范数解对或最小Frobenius范数最小二乘解对。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号