2002
DOI: 10.1142/s0218127402004498
|View full text |Cite
|
Sign up to set email alerts
|

MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS

Abstract: We present a new continuation method for computing implicitly defined manifolds. The manifold is represented as a set of overlapping neighborhoods, and extended by an added neighborhood of a boundary point. The boundary point is found using an expression for the boundary in terms of the vertices of a set of finite, convex polyhedra. The resulting algorithm is quite simple, allows adaptive spacing of the computed points, and deals with the problems of local and global overlap in a natural way. The algorithm is … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
145
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 121 publications
(145 citation statements)
references
References 31 publications
0
145
0
Order By: Relevance
“…The methods that have been proposed essentially fall into two classes: simplicial methods (e.g. see [10] and references therein) and predictor-corrector methods (see [6,7,8,16]). Predictor-corrector methods show more favorable computational complexity in the case of low dimensional manifolds embedded in a high dimensional space, which is the case of interest for us.…”
Section: Multi-parameter Continuation Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…The methods that have been proposed essentially fall into two classes: simplicial methods (e.g. see [10] and references therein) and predictor-corrector methods (see [6,7,8,16]). Predictor-corrector methods show more favorable computational complexity in the case of low dimensional manifolds embedded in a high dimensional space, which is the case of interest for us.…”
Section: Multi-parameter Continuation Algorithmmentioning
confidence: 99%
“…From our standpoint, the main feature that distinguishes among the predictor-corrector methods cited above is how the manifold is represented. In [6], the manifold is represented as a set of overlapping neighborhoods, each defined through a chart, a center point, basis for the tangent space at the center point, and other relevant data. A triangulation of the manifold can be constructed a posteriori by appropriately connecting the center points of the neighborhoods, but this does not allow for adaptive construction of the triangulation.…”
Section: Multi-parameter Continuation Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…In many problems, however, it may be sufficient to explore only those configurations that are path-connected to a given point. To this end, the CUIK suite implements higher-dimensional continuation tools allowing to trace arbitrary manifolds [10]. While branch-and-prune meth- ods proceed by discarding non-valid configurations, continuation techniques march from a given point in all directions identifying new feasible configurations.…”
Section: Motivation and Outlookmentioning
confidence: 99%
“…To this end, the CUIK suite implements higher-dimensional continuation tools allowing to trace arbitrary, implicitly-defined manifolds [6]. Note that while several packages provide state-of-the-art path planning methods, they are oriented to open-chain robots [11,22,21,23], or to particular classes of closed-chain devices [10].…”
Section: Introductionmentioning
confidence: 99%