1996
DOI: 10.1016/0098-1354(95)00199-9
|View full text |Cite
|
Sign up to set email alerts
|

A robust path tracking algorithm for homotopy continuation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2000
2000
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 32 publications
(21 citation statements)
references
References 7 publications
0
21
0
Order By: Relevance
“…The subscripts 0 at T k + 1 and P k + 1 in formulas (14) mean that these values lie not on the binodal line but in its close vicinity, and at each ((k + 1)th) predictor step, they serve as initial approximations for Newton's method.…”
Section: Construction Of Trajectories Of Solutionsmentioning
confidence: 99%
See 3 more Smart Citations
“…The subscripts 0 at T k + 1 and P k + 1 in formulas (14) mean that these values lie not on the binodal line but in its close vicinity, and at each ((k + 1)th) predictor step, they serve as initial approximations for Newton's method.…”
Section: Construction Of Trajectories Of Solutionsmentioning
confidence: 99%
“…In iterations at a predictor step (k > 0), the sign of the parameter σ k is also controlled [13,14].…”
Section: Construction Of Trajectories Of Solutionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, an engineeringfriendly point of view can be found in numerous articles (e.g. Choi et al, 1996;Kuno and Seader, 1988;Seader et al, 1990;Seider et al, 1991;Seydel and Hlavacek, 1987;Wayburn and Seader, 1987).…”
Section: Introductionmentioning
confidence: 99%