首页> 外国专利> Hybrid representation scheme for factor L in sparse direct matrix factorization

Hybrid representation scheme for factor L in sparse direct matrix factorization

机译:稀疏直接矩阵分解中因子L的混合表示方案

摘要

A system that efficiently performs a CMOD operation in solving a system of equations involving a sparse coefficient matrix by identifying supernodes in the sparse matrix. Each supernode comprises a set of contiguous columns having a substantially similar pattern of non-zero elements. The system performs a CMOD operation on each supernode, by determining a structure for the supernode, and computing a function of the structure. The system uses a one-dimensional trapezoidal representation for the supernode during the CMOD operation, if the result of the function is lower than a threshold value, and otherwise uses a two-dimensional rectangular representation for the supernode. The function of the structure of the supernode is a function of a number of computational operations involved in computing a lower-triangular sub-block portion of the supernode and a number of computational operations involved in computing a rectangular sub-block portion of the supernode.
机译:通过识别稀疏矩阵中的超节点,可以有效地执行CMOD运算来求解涉及稀疏系数矩阵的方程组的系统。每个超节点包括一组具有基本相似的非零元素图案的连续列。系统通过确定超级节点的结构并计算该结构的功能,对每个超级节点执行CMOD操作。如果函数的结果低于阈值,则系统在CMOD操作期间对超节点使用一维梯形表示,否则对超节点使用二维矩形表示。超级节点的结构的功能是计算超级节点的下三角子块部分所涉及的许多计算操作和计算超级节点的矩形子块部分所涉及的许多计算操作的函数。

著录项

  • 公开/公告号US6601080B1

    专利类型

  • 公开/公告日2003-07-29

    原文格式PDF

  • 申请/专利权人 SUN MICROSYSTEMS INC.;

    申请/专利号US20000510911

  • 发明设计人 RAJAT P. GARG;

    申请日2000-02-23

  • 分类号G06F73/80;

  • 国家 US

  • 入库时间 2022-08-22 00:05:06

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号