首页> 外文期刊>Applied Mathematics >In-Place Matrix Inversion by Modified Gauss-Jordan Algorithm
【24h】

In-Place Matrix Inversion by Modified Gauss-Jordan Algorithm

机译:改进的Gauss-Jordan算法进行原位矩阵求逆

获取原文
       

摘要

The classical Gauss-Jordan method for matrix inversion involves augmenting the matrix with a unit matrix and requires a workspace twice as large as the original matrix as well as computational operations to be performed on both the original and the unit matrix. A modified version of the method for performing the inversion without explicitly generating the unit matrix by replicating its functionality within the original matrix space for more efficient utilization of computational resources is presented in this article. Although the algorithm described here picks the pivots solely from the diagonal which, therefore, may not contain a zero, it did not pose any problem for the author because he used it to invert structural stiffness matrices which met this requirement. Techniques such as row/column swapping to handle off-diagonal pivots are also applicable to this method but are beyond the scope of this article.
机译:用于矩阵求逆的经典高斯-乔丹方法涉及用单位矩阵扩充矩阵,并且需要两倍于原始矩阵的工作空间以及要在原始矩阵和单位矩阵上执行的计算操作。本文介绍了一种用于执行反演的方法的改进版本,而无需通过在原始矩阵空间内复制其功能来显式生成单位矩阵,从而更有效地利用计算资源。尽管此处描述的算法仅从对角线中选取枢轴,因此可能不包含零,但对于作者而言,这没有任何问题,因为他使用它来反转满足此要求的结构刚度矩阵。行/列交换等技术可用于处理非对角枢轴,也适用于此方法,但不在本文讨论范围之内。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号