2001
DOI: 10.1016/s0377-0427(00)00711-1
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for finding all solutions of a nonlinear system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2001
2001
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 15 publications
0
11
0
Order By: Relevance
“…According to Smiley and Chun (2001) For each subdivision level, the subintervals obtained are tested for the existence of roots in order that only those containing one or more solutions are maintained. The selection criterion is based on calculation of the Euclidean norm of the set of equations:…”
Section: Subdivision Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…According to Smiley and Chun (2001) For each subdivision level, the subintervals obtained are tested for the existence of roots in order that only those containing one or more solutions are maintained. The selection criterion is based on calculation of the Euclidean norm of the set of equations:…”
Section: Subdivision Algorithmmentioning
confidence: 99%
“…the Newton-Raphson method) is employed to determine the roots, taking as initial values the middle points of the last subintervals. Since the solutions are confined to the retained subintervals, the convergence of the adopted method becomes more efficient and reliable (Smiley and Chun, 2001).…”
Section: Subdivision Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The performance and success of this method in finding all possible solutions (roots) are directly associated with the choice of homotopy type (Wayburn and Seader, 1987). Smiley and Chun (2001) recently presented a subdivision algorithm with exclusion to locate all roots of a nonlinear algebraic system, where the authors present a section proofing the convergence for the subdivision algorithm. In general, subdivision algorithms consist in establishing initial intervals for the system variables and then a systematically subdividing these intervals.…”
Section: Brazilian Journal Of Chemical Engineeringmentioning
confidence: 99%
“…Considering a system of nonlinear algebraic equations, F(x), in accordance with Smiley and Chun (2001), the basic idea of the proposed subdivision algorithm is as follows: given an initial interval for unknown variables ("rectangle") R ∈ ℜ passes the test, it is retained (saved) and will be a new "parent" rectangle, which in turn will divide at i = i + 1. In the present work, the following selection criterion was used to test the existence of solution in a rectangle:…”
Section: Subdivision Algorithmmentioning
confidence: 99%