2016
DOI: 10.1002/aic.15319
|View full text |Cite
|
Sign up to set email alerts
|

Reliable mixture critical point computation using polynomial homotopy continuation

Abstract: The numerical computation of multicomponent mixture critical points has been the subject of much study due to their theoretical and practical importance. Both deterministic and stochastic methods have been applied with varying degrees of reliability and robustness. In this work, we utilize numerical polynomial homotopy continuation (NPHC) to reliably identify all mixture critical points. This method is unique due to its robustness, initialization‐free nature and ease of parallelization. For a given system of e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 53 publications
(106 reference statements)
0
6
0
Order By: Relevance
“…A huge quantity of numerical procedures can be applied in the solution of this kind of system. Among these, we can mention Newton-type methods (Dimitrakopoulos et al, 2014), homotopy-continuation procedures (Sidky et al, 2016;Wang et al, 1999) and interval methods (Stradi et al, 2001). Here, we employ the methodology of numerical inversion of functions from the plane to the plane, proposed by Malta et al (1993).…”
Section: Numerical Methodologymentioning
confidence: 99%
See 1 more Smart Citation
“…A huge quantity of numerical procedures can be applied in the solution of this kind of system. Among these, we can mention Newton-type methods (Dimitrakopoulos et al, 2014), homotopy-continuation procedures (Sidky et al, 2016;Wang et al, 1999) and interval methods (Stradi et al, 2001). Here, we employ the methodology of numerical inversion of functions from the plane to the plane, proposed by Malta et al (1993).…”
Section: Numerical Methodologymentioning
confidence: 99%
“…Their algorithm exhibits mathematical and computational guarantees to obtain all critical points. More recently, Sidky, Whitmer, and Mehta (2016) employed a polynomial homotopy continuation algorithm-also a robust method-in the calculation of critical points. Previously, Wang, Wong, Chen, Yan, and Guo (1999) used a homotopy-based method to obtain the critical loci of binary mixtures.…”
Section: Introductionmentioning
confidence: 99%
“…Polynomial homotopy continuation has also been adapted to the field of chemical engineering to locate critical points of multicomponent mixtures [SWM16], i.e., temperature and pressure satisfying a multiphase equilibrium.…”
Section: Critical Point Computationmentioning
confidence: 99%
“…Finding all solutions can be guaranteed in some cases, for example, continuous polynomial systems. 10 However, constructing a proper homotopy function is very important but it is an experienced task. The global terrain method is another method for finding all mathematical solutions.…”
Section: Introductionmentioning
confidence: 99%
“…This is a sophisticated global method for gradually approaching a solution set for the equations from a starting point that satisfies another simpler system of equations. , In practice, homotopy continuation methods are frequently used in finding all solutions of arbitrary nonlinear systems of equations. Finding all solutions can be guaranteed in some cases, for example, continuous polynomial systems . However, constructing a proper homotopy function is very important but it is an experienced task.…”
Section: Introductionmentioning
confidence: 99%