A parallelization of an equation-based algorithm for multicomponent separation calculations
O'Neill, Alfred John
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/20158
Description
Title
A parallelization of an equation-based algorithm for multicomponent separation calculations
Author(s)
O'Neill, Alfred John
Issue Date
1991
Doctoral Committee Chair(s)
Stadtherr, Mark A.
Department of Study
Chemical and Biomolecular Engineering
Discipline
Chemical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Chemical
Computer Science
Language
eng
Abstract
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.
"A close examination of the regular structure of the linear system reveals the possibility of a further improvement in the methd: a pretreatment of the matrix to reduce both the cost of system reduction and the overhead inherent in the parallel technique. The separate approaches result in three competing methods, which are compared on a parallel machine for a variety of problems. The results of this system of tests leads to an ""advanced"" method which incorporates the best features of the successful algorithms."
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
