1990
DOI: 10.1007/978-3-642-61257-2
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Continuation Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
513
0
10

Year Published

1998
1998
2007
2007

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 1,100 publications
(524 citation statements)
references
References 291 publications
1
513
0
10
Order By: Relevance
“…c n ε n (25) and insert these directly into (2). Equating at orders of ε one recovers, at order one, the linear solutions (6) provided that c 0 satisfies (5) for two wavenumbers k 1 and k 2 .…”
Section: Boundary Perturbation Methods For Traveling Wavesmentioning
confidence: 88%
See 1 more Smart Citation
“…c n ε n (25) and insert these directly into (2). Equating at orders of ε one recovers, at order one, the linear solutions (6) provided that c 0 satisfies (5) for two wavenumbers k 1 and k 2 .…”
Section: Boundary Perturbation Methods For Traveling Wavesmentioning
confidence: 88%
“…The computations of Nicholls [50,51], and Craig & Nicholls [24] were based on an OE implementation of the DNO, but were performed at a relatively low perturbation order, N = 5. These simulations utilized Boundary Perturbations solely in the computation of the DNO and otherwise used numerical continuation [42,2] to find solutions of (11) along the branch using a predictorcorrector algorithm.…”
Section: For Demonstrations)mentioning
confidence: 99%
“…These methods of computational linear algebra are widely used and their details are well-known. Therefore we are not discussing it here ( [22,23]). …”
Section: A Few Words About the Specifics Of The Computational Difficumentioning
confidence: 99%
“…The standard prediction stage is carried out by a tangent (or Euler) approximation, and the standard correction is performed by Newton's method or one of its variants. We refer to [1] for an excellent overview of continuation techniques. Now, while continuing the curve of equilibria, a robust algorithm must also be able to adaptively choose the steps to be taken, and to detect bifurcation values (e.g., points where two solution curves intersect, or points where -for (1)-the curve fails to be parametrizable in α).…”
Section: Introductionmentioning
confidence: 99%