.png){kind=icon}
返回
A multilevel unsymmetric matrix ordering algorithm for parallel process simulation
.png){kind=icon}
OA
AI
DOI：10.1016/S0098-1354(99)00314-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Computer simulation of complex chemical processes is increasingly being used in the design optimization and control of chemical facilities. Industrial-scale modeling involves the solution of large systems of algebraic differential equations. This is very computationally intensive with a large part of the computing time attributed to the repeated solution of large, sparse, unsymmetric systems of linear equations. One way of speeding up the simulation is to solve the linear systems efficiently in parallel by reordering the unsymmetric matrices into a bordered block-diagonal (BBD) form. In this paper a multilevel ordering algorithm is presented. A multilevel technique, which provides a global view, is combined with a Kernighan-Lin algorithm to form an effective unsymmetric matrix ordering algorithm MONET (Matrix Ordering for minimal NET-cut). Numerical results confirm that this algorithm gives ordering of better quality than existing algorithms. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keyword:
chemical process simulation
sparse unsymmetric matrix ordering
bordered block diagonal
graph partitioning
multilevel parallel computation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容