Premium
Global preordering for Newton equations using model hierarchy
Author(s) -
Abbott Kirk A.,
Allan Benjamin A.,
Westerberg Arthur W.
Publication year - 1997
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.690431207
Subject(s) - computer science , a priori and a posteriori , hierarchy , factoring , algorithm , mathematical optimization , factorization , matrix (chemical analysis) , mathematics , economics , market economy , philosophy , materials science , epistemology , finance , composite material
In solving large simulation problems using Newton's method, a large sparse linear system Ax = b has to be solved. The cost of solving its problems can dominate the overall solution cost of the problem. Current approaches of reducing these costs are reviewed, and then a new algorithm for preordering the sparse matrix A is described that is based on the hierarchical structure provided by an object‐oriented description of many recent modeling systems such as ASCEND, gPROMS, DIVA, and Omola. Particularly, rapid preorderings are obtained to support interactive manipulation of models and efficient solutions in automatic process synthesis algorithms, two applications where the preordering cost will be spread over only a few factorizations. With a factorization routine that permits a‐priori reorderings (LU1SOL), this algorithm produces order of magnitude reductions in analysis and factoring times as well as in fill and operation count over our previous experience. The time to factor the 50,000 Newton equations for a highly recycled ethylene plant model is of the order of a few seconds on a conventional workstation. Abstracting and applying the fundamental concepts of this algorithm made it possible to improve the performance of the ma28 code significantly. This approach makes solution speeds competitive with and generally more consistent than codes considered the state‐of‐the‐art (ma48 and umfpack 1.0).