Related papers: Numerical homotopies from Khovanskii bases
The global minimum point of an optimization problem is of interest in engineering fields and it is difficult to be found, especially for a nonconvex large-scale optimization problem. In this article, we consider a new memetic algorithm for…
We study the de Rham complex of relative differential forms on compact manifolds with boundary. Chain homotopies for this complex are highly non-unique, and different homotopies can have different analytic properties, particularly near the…
Applying the Second Main Theorem we deal with the algebraic degeneracy of entire holomorphic curves from the complex plane into a complex algebraic normal variety of positive log Kodaira dimension that admits a finite proper morphism to a…
We present our implementation of an algorithm which functions as a numerical oracle for the Newton polytope of a hypersurface in the Macaulay2 package NumericalNP.m2. We propose a tropical membership test, relying on this algorithm, for…
We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. One key ingredient of this…
Topologically ordered quantum matter exhibits intriguing long-range patterns of entanglement, which reveal themselves in subsystem entropies. However, measuring such entropies, which can be used to certify topological order, on large…
There has been increasing interest in studying the Richardson model from which one can derive the exact solution for certain pairing Hamiltonians. However, it is still a numerical challenge to solve the nonlinear equations involved. In this…
Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…
First order shape optimization methods, in general, require a large number of iterations until they reach a locally optimal design. While higher order methods can significantly reduce the number of iterations, they exhibit only local…
We propose a homotopy method for solving mathematical programs with complementarity constraints (CCs). The indicator function of the CCs is relaxed by a Lasry-Lions double envelope, an extension of the Moreau envelope that enjoys an…
This work proposes an adaptive structure-preserving model order reduction method for finite-dimensional parametrized Hamiltonian systems modeling non-dissipative phenomena. To overcome the slowly decaying Kolmogorov width typical of…
We establish second main theorems for holomorphic curves into a projective subvary $V \subset \mathbb{P}^n(\mathbb{C})$ of dimension $k$, intersecting hypersurfaces in $N$-subgeneral position with respect to $V$ $(N > k)$. Our results…
Given a gapped Hamiltonian of a spin chain, we give a polynomial-time algorithm for finding the degenerate ground space projector. The output is an orthonormal set of matrix product states that approximate the true ground space projector up…
In this paper, based on the homotopy continuation method and the interval Newton method, an efficient algorithm is introduced to isolate the real roots of semi-algebraic system. Tests on some random examples and a variety of problems…
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring.…
Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…
An algorithm is presented for numerical computation of choreographies in spaces of constant negative curvature in a hyperbolic cotangent potential, extending the ideas given in a companion paper for computing choreographies in the plane in…
We present a homotopic approach to solving challenging, optimization-based motion planning problems. The approach uses Homotopy Optimization, which, unlike standard continuation methods for solving homotopy problems, solves a sequence of…
A Hamiltonian formulation of generic many-particle systems with space-dependent balanced loss and gain coefficients is presented. It is shown that the balancing of loss and gain necessarily occurs in a pair-wise fashion. Further, using a…
Based on previous results of digital topology, this paper focuses on algorithms of topological invariants of objects in 2D and 3D Digital Spaces. We specifically interest in solving hole counting of 2D objects and genus of closed surface in…