【24h】

An Iterative Algorithm for the Least Squares Centrosymmetric Solution of a Matrix Equation

机译:一种矩阵方程最小二乘焦体解的迭代算法

获取原文

摘要

In this paper, the linear mapping from the constrained solution sets to their independent parameter spaces is constructed, and its properties are studied. Based on these properties and the classical algorithm LSQR for solving the (unconstrained) LS problem, a matrix iterative method that can find the special Centro symmetric solution is proposed. Numerical results are reported that show the efficiency of the proposed method.
机译:在本文中,构造了从受约束的解决方案组到其独立参数空间的线性映射,研究了其性质。 基于这些属性和求解(不受约束)LS问题的经典算法LSQR,提出了一种可以找到特殊的CentRo对称解决方案的矩阵迭代方法。 报告了数值结果,显示了所提出的方法的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号