...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical methods of operations research >Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
【24h】

Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming

机译：Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

This study analyzes the influence of sparse matrix reordering on the solution of linear systems arising from interior point methods for linear programming. In particular, such linear systems are solved by the conjugate gradient method with a two-phase hybrid preconditioner that uses the controlled Cholesky factorization during the initial iterations and later adopts the splitting preconditioner. This approach yields satisfactory computational results for the solution of linear systems with symmetric positive-definite matrices. Three reordering heuristics are analyzed in this study: the reverse Cuthill-McKee heuristic, the Sloan algorithm, and the minimum degree heuristic. Through numerical experiments, it was observed that these heuristics can be advantageous in terms of accelerating the convergence of the conjugate gradient method and reducing the processing time.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号