Reliable computation of equilibrium cascades with affine arithmetic

Ali Banarev, Endre Rév

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Computing the steady state of multistage counter-current processes like distillation, extraction, or absorption is the equivalent to finding solutions for large-scale nonlinear equation systems. The conventional solution techniques are fast and efficient if a good estimation is available, but are prone to fail, and do not provide information about the reason for the failure. This is the main motive to apply reliable methods in solving them. Reliable computations are usually realized with interval methods. A reliable root finding method is presented, based on affine arithmetic (AA), a recently developed linearization technique and interval method. AA is compared here to another linearization technique, the widely known Interval Newton method. The studied examples seem to indicate superiority of the novel method over the traditional one. The comparison is made with a pruning technique not state-of-the-art, but analogous in the two compared methods. AA can be combined with constraint propagation (CP), or linear programming (LP) aided CP, as pruning techniques. The combined techniques, AA/CP and AA/ LP are studied and compared. AA/LP proves to be preferable because of its robustness. Short distillation columns are successfully computed with the proposed AAILP method.

Original languageEnglish
Pages (from-to)1782-1797
Number of pages16
JournalAICHE Journal
Volume54
Issue number7
DOIs
Publication statusPublished - Jul 2008

Fingerprint

Linear programming
Linearization
Linear Programming
Distillation columns
Newton-Raphson method
Nonlinear equations
Distillation

Keywords

  • Affine arithmetic
  • Interval arithmetic
  • MESH equations
  • Reliable computation
  • Root finding

ASJC Scopus subject areas

  • Biotechnology
  • Chemical Engineering(all)
  • Mechanical Engineering
  • Environmental Engineering
  • Polymers and Plastics

Cite this

Reliable computation of equilibrium cascades with affine arithmetic. / Banarev, Ali; Rév, Endre.

In: AICHE Journal, Vol. 54, No. 7, 07.2008, p. 1782-1797.

Research output: Contribution to journalArticle

@article{1e7efc9ea36e4db8823f7f4c1cf8a4a1,
title = "Reliable computation of equilibrium cascades with affine arithmetic",
abstract = "Computing the steady state of multistage counter-current processes like distillation, extraction, or absorption is the equivalent to finding solutions for large-scale nonlinear equation systems. The conventional solution techniques are fast and efficient if a good estimation is available, but are prone to fail, and do not provide information about the reason for the failure. This is the main motive to apply reliable methods in solving them. Reliable computations are usually realized with interval methods. A reliable root finding method is presented, based on affine arithmetic (AA), a recently developed linearization technique and interval method. AA is compared here to another linearization technique, the widely known Interval Newton method. The studied examples seem to indicate superiority of the novel method over the traditional one. The comparison is made with a pruning technique not state-of-the-art, but analogous in the two compared methods. AA can be combined with constraint propagation (CP), or linear programming (LP) aided CP, as pruning techniques. The combined techniques, AA/CP and AA/ LP are studied and compared. AA/LP proves to be preferable because of its robustness. Short distillation columns are successfully computed with the proposed AAILP method.",
keywords = "Affine arithmetic, Interval arithmetic, MESH equations, Reliable computation, Root finding",
author = "Ali Banarev and Endre R{\'e}v",
year = "2008",
month = "7",
doi = "10.1002/aic.11490",
language = "English",
volume = "54",
pages = "1782--1797",
journal = "AICHE Journal",
issn = "0001-1541",
publisher = "American Institute of Chemical Engineers",
number = "7",

}

TY - JOUR

T1 - Reliable computation of equilibrium cascades with affine arithmetic

AU - Banarev, Ali

AU - Rév, Endre

PY - 2008/7

Y1 - 2008/7

N2 - Computing the steady state of multistage counter-current processes like distillation, extraction, or absorption is the equivalent to finding solutions for large-scale nonlinear equation systems. The conventional solution techniques are fast and efficient if a good estimation is available, but are prone to fail, and do not provide information about the reason for the failure. This is the main motive to apply reliable methods in solving them. Reliable computations are usually realized with interval methods. A reliable root finding method is presented, based on affine arithmetic (AA), a recently developed linearization technique and interval method. AA is compared here to another linearization technique, the widely known Interval Newton method. The studied examples seem to indicate superiority of the novel method over the traditional one. The comparison is made with a pruning technique not state-of-the-art, but analogous in the two compared methods. AA can be combined with constraint propagation (CP), or linear programming (LP) aided CP, as pruning techniques. The combined techniques, AA/CP and AA/ LP are studied and compared. AA/LP proves to be preferable because of its robustness. Short distillation columns are successfully computed with the proposed AAILP method.

AB - Computing the steady state of multistage counter-current processes like distillation, extraction, or absorption is the equivalent to finding solutions for large-scale nonlinear equation systems. The conventional solution techniques are fast and efficient if a good estimation is available, but are prone to fail, and do not provide information about the reason for the failure. This is the main motive to apply reliable methods in solving them. Reliable computations are usually realized with interval methods. A reliable root finding method is presented, based on affine arithmetic (AA), a recently developed linearization technique and interval method. AA is compared here to another linearization technique, the widely known Interval Newton method. The studied examples seem to indicate superiority of the novel method over the traditional one. The comparison is made with a pruning technique not state-of-the-art, but analogous in the two compared methods. AA can be combined with constraint propagation (CP), or linear programming (LP) aided CP, as pruning techniques. The combined techniques, AA/CP and AA/ LP are studied and compared. AA/LP proves to be preferable because of its robustness. Short distillation columns are successfully computed with the proposed AAILP method.

KW - Affine arithmetic

KW - Interval arithmetic

KW - MESH equations

KW - Reliable computation

KW - Root finding

UR - http://www.scopus.com/inward/record.url?scp=47549103187&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47549103187&partnerID=8YFLogxK

U2 - 10.1002/aic.11490

DO - 10.1002/aic.11490

M3 - Article

AN - SCOPUS:47549103187

VL - 54

SP - 1782

EP - 1797

JO - AICHE Journal

JF - AICHE Journal

SN - 0001-1541

IS - 7

ER -