A parallelization of an equation-based algorithm for multicomponent separation calculations

Multicomponent separation calculations, whether for single columns or for complexly interlinked systems of multiple columns, represent large scale computational problems and are thus attractive applications for the parallel computing architectures of modern supercomputers. Frequently, these problems are formulated as a large set of nonlinear equations solved by a Newton-Raphson or comparable successive linearization technique. They thus require the solution of a very large system of sparse linear equations, which often represents a large fraction of the overall computing time. An efficient parallel technique for the solution of such large sparse systems, based on an ordering of equations by plate, is presented. The resulting linear systems take on an almost block tridiagonal (BTD) form, with off-BTD blocks arising from recycle streams or tower sidestreams. Extensions to a current multiprocessor scheme for BTD systems, the Sameh method, are also given.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Chemical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• O'Neill, Alfred John

Contributors dc:contributor

• Stadtherr, Mark A.

• Engineering, Chemical
• Computer Science

Statement dc:rights

• Copyright 1991 O'Neill, Alfred John

Language dc:language

eng

Identifier

AAI9210940
(UMI)AAI9210940

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/20158