返回
Matrix reordering effects on a parallel frontal solver for large scale process simulation
DOI:10.1016/S0098-1354(98)00295-6.png)
摘要
En 中文
For the simulation and optimization of large scale chemical processes, the overall computing time is often dominated by the time needed to solve a large sparse system of linear equations. A parallel frontal solver can be used to significantly reduce the wallclock time required to solve these linear equation systems using parallel/vector supercomputers. This is done by exploiting both multiprocessing and vector processing, using a multifrontal-type approach in which frontal elimination is used for the partial factorization of each front. However, the algorithm is based on a bordered block-diagonal matrix form and thus its performance depends on the extent to which the matrix can be reordered to this form. Various approaches to achieving this ordering are discussed here. The performance of these different matrix reordering strategies for achieving the bordered block-diagonal form is then considered. Results, including a visualization of the different matrix orderings on one problem, are presented for several large scale process engineering problems. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
CHEMICAL PROCESS SIMULATION
SUPERCOMPUTERS
STRATEGIES
VECTOR
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
Uncertainties in Calibrating a Stylus Type Surface Texture Measuring Instrument with an Interferometrically Measured Step
Metrologia
IF0
Recognition of Isopentenylpyrophosphate and Daudi Tumor Cells By Distinct Subsets of Vγ2/Vδ2 T Cells

