1987
DOI: 10.1145/29380.214343
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm 652

Abstract: There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK provides three qualitatively different algorithms for tracking the homotopy zero curve: ordinary differential equation-based, normal flow, and augmented Jacobian matrix.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
133
0
4

Year Published

1996
1996
2015
2015

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 351 publications
(137 citation statements)
references
References 25 publications
0
133
0
4
Order By: Relevance
“…Next, a globally convergent homotopy based nonlinear system solver, subroutine FIXPDF from the HOMPACK (Watson, Billups, and Morgan [25]) suite of codes, was used. This method (using the default homotopy map) tracks the zero curve of ),…”
Section: Methodsmentioning
confidence: 99%
“…Next, a globally convergent homotopy based nonlinear system solver, subroutine FIXPDF from the HOMPACK (Watson, Billups, and Morgan [25]) suite of codes, was used. This method (using the default homotopy map) tracks the zero curve of ),…”
Section: Methodsmentioning
confidence: 99%
“…The following circuit is described by a system of nonlinear equations with 14 variables 13 . This circuit contain four transistor and one diode as shown in Fig.…”
Section: Case Study With 14 Variablesmentioning
confidence: 99%
“…Such methods are becoming a viable alternative in circuit simulation, where they can be used to resolve convergence difficulties and to find multiple operation points. These methods are slower than conventional methods but their speed can often be improved by careful implementation [12][13][14][15][16][17].…”
Section: Introductionmentioning
confidence: 99%
“…There are many attempts to cope with these problems. Among these global methods are line search methods as the Armijo rule [1], trust region methods [17], homotopy [61], and pseudo-transient continuation [35]. Additionally, stability problems of the structure are frequently solved by means of the arc-length method on global level, see Eq.…”
Section: F(t Y(t)ẏ(t)) := G(t U(t) Q(t)) Q(t) − R(t U(t)u(t) Qmentioning
confidence: 99%