Related papers: Certified numerical homotopy tracking
A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…
It is highly desirable for a numerical approximation of a stationary point for a potential energy landscape to lie in the quadratic convergence basin of that stationary point. However, it is possible that an approximation may lie only in…
This paper centers around two basic problems of topological coincidence theory. First, try to measure (with help of Nielsen and minimum numbers) how far a given pair of maps is from being loose, i.e. from being homotopic to a pair of…
The homotopy analysis method is studied in the present paper. The question of convergence of the homotopy analysis method is resolved. It is proven that under a special constraint the homotopy analysis method does converge to the exact…
We present a continuation method to compute all zeros of a harmonic mapping $f$ in the complex plane. Our method works without any prior knowledge of the number of zeros or their approximate location. We start by computing all solution of…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number $\varepsilon>0$, we construct a closed…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
We address the homotopy theory of 2-crossed modules of commutative algebras, which are equivalent to simplicial commutative algebras with Moore complex of length two. In particular, we construct for maps of 2-crossed modules a homotopy…
We consider polynomial systems of Prony type, appearing in many areas of mathematics. Their robust numerical solution is considered to be difficult, especially in "near-colliding" situations. We consider a case when the structure of the…
We study the connectedness locus $\mathcal{N}$ for the family of iterated function systems of pairs of homogeneous affine-linear maps in the plane. We prove this set is regular closed (i.e., it is the closure of its interior) away from the…
We present a new continuation algorithm to find all nondegenerate real solutions to a system of polynomial equations. Unlike homotopy methods, it is not based on a deformation of the system; instead, it traces real curves connecting the…
We reexamine Smale's alpha theory as a way to certify a numerical solution to an analytic system. For a given point and a system, Smale's alpha theory determines whether Newton's method applied to this point shows the quadratic convergence…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural…
We are able to improve what is known about two assumed homogeneous polynomials cutting out Macaulay's curve $C_4\subseteq P^3_k$ set-theoretically, in characteristic zero. We use local cohomology and an idea from Thoma.
Three aspects of applying homotopy continuation, which is commonly used to solve parameterized systems of polynomial equations, are investigated. First, for parameterized systems which are homogeneous, we investigate options for performing…
In this paper, we present an adaptive step-size homotopy tracking method for computing bifurcation points of nonlinear systems. There are four components in this new method: 1) an adaptive tracking technique is developed near bifurcation…
In this paper, we review a method for computing and parameterizing the set of homotopy classes of chain maps between two chain complexes. This is then applied to finding topologically meaningful maps between simplicial complexes, which in…
Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target…