Premium
Strategies for equilibrium‐stage separation calculations on parallel computers
Author(s) -
O'Neill Alfred J.,
Kaiser Daniel J.,
Stadtherr Mark A.
Publication year - 1994
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.690400109
Subject(s) - tridiagonal matrix , block (permutation group theory) , computer science , bottleneck , parallel computing , linearization , computation , sparse matrix , parallelism (grammar) , tridiagonal matrix algorithm , parallel algorithm , matrix (chemical analysis) , linear system , algorithm , mathematical optimization , computational science , mathematics , nonlinear system , mathematical analysis , eigenvalues and eigenvectors , physics , geometry , materials science , quantum mechanics , composite material , gaussian , embedded system
When multicomponent, multistage separation problems are solved on parallel computers by successive linearization methods, the solution of a large sparse linear equation system becomes a computational bottleneck, since other parts of the calculation are more easily parallelized. When the standard problem formulation is used, this system has a block‐tridiagonal form. It is shown how this structure can be used in parallelizing the sparse matrix computation. By reformulating the problem so that it has a bordered‐block‐bidiagonal superstructure, it can be made even more amenable to parallezation. These strategies permit the use of a two‐level hierarchy of parallelism that provides substantial improvements in computational performance on parallel machines.