Multiple parameter continuation: Computing implicitly defined k-manifolds

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 robust (the new points need only be near the boundary), and is well suited to problems with large embedding dimension, and small to moderate dimension.