首页> 外文期刊>Annals of the West University of Timisoara: Mathematics and Computer Science >Interchange Opportunity in Average Bandwidth Reduction in Sparse Matrices
【24h】

Interchange Opportunity in Average Bandwidth Reduction in Sparse Matrices

机译:稀疏矩阵中平均带宽减少的交换机会

获取原文
       

摘要

This paper proposes two methods for determining suit- able interchanges of lines/columns in case of average bandwidth re- duction in sparse and symmetric matrices. First, a greedy heuristic inspired by the laws of physics (mechanics) to reduce the average bandwidth is proposed. The second method is an exact method that allows to estimate the potential of a row/column interchange to reduce the average bandwidth.
机译:本文提出了两种方法,用于在稀疏和对称矩阵中平均带宽减少的情况下确定线/列的适当互换。首先,提出了一种受物理定律(力学)启发而降低平均带宽的贪婪启发式算法。第二种方法是一种精确的方法,它允许估计行/列交换的可能性以减少平均带宽。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号