Related papers: Numerical homotopies from Khovanskii bases
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
Model order reduction provides low-complexity high-fidelity surrogate models that allow rapid and accurate solutions of parametric differential equations. The development of reduced order models for parametric \emph{nonlinear} Hamiltonian…
In this paper, we propose an inertial forward backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method…
Force-gradient decomposition methods are used to improve the energy preservation of symplectic schemes applied to Hamiltonian systems. If the potential is composed of different parts with strongly varying dynamics, this multirate potential…
We introduce an algebraic method for describing the Hodge filtration of degenerating hypersurfaces in projective toric varieties. For this purpose, we show some fundamental properties of logarithmic differential forms on proper equivariant…
Modified Hamiltonians are used in the field of geometric numerical integration to show that symplectic schemes for Hamiltonian systems are accurate over long times. For nonlinear systems the series defining the modified Hamiltonian usually…
In the spirit of recent work of Harada-Kaveh and Nishinou-Nohara-Ueda, we study the symplectic geometry of Popov's horospherical degenerations of complex algebraic varieties with the action of a complex linearly reductive group. We…
The purpose of this paper is to study the topology of certain toric varieties $X_I$, arising as quotients of the action of $\C^*$ on complements of arrangements of coordinate subspaces in $\C^n$, and to improve the homotopy stability…
Homotopy optimization is a traditional method to deal with a complicated optimization problem by solving a sequence of easy-to-hard surrogate subproblems. However, this method can be very sensitive to the continuation schedule design and…
Hamiltonian Monte Carlo has emerged as a standard tool for posterior computation. In this article, we present an extension that can efficiently explore target distributions with discontinuous densities. Our extension in particular enables…
In this paper we present deflation and augmentation techniques that have been designed to accelerate the convergence of Krylov subspace methods for the solution of linear systems of equations. We review numerical approaches both for linear…
A method for solving zero-finding problems is developed by tracking homotopy paths, which define connecting channels between an auxiliary problem and the objective problem. Current algorithms' success highly relies on empirical knowledge,…
For fourth-order geometric evolution equations for planar curves with the dissipation of the bending energy, including the Willmore and the Helfrich flows, we consider a numerical approach. In this study, we construct a structure-preserving…
We propose a sequential homotopy method for the solution of mathematical programming problems formulated in abstract Hilbert spaces under the Guignard constraint qualification. The method is equivalent to performing projected backward Euler…
Following the first part of our project, this paper comprehensively studies two types of extragradient-based methods: anchored extragradient and Nesterov's accelerated extragradient for solving [non]linear inclusions (and, in particular,…
We propose an inertial forward-backward splitting algorithm to compute the zero of a sum of two monotone operators allowing for stochastic errors in the computation of the operators. More precisely, we establish almost sure convergence in…
Given a map of vector bundles on a smooth variety, consider the deepest degeneracy locus where its rank is smallest. We show it carries a natural perfect obstruction theory whose virtual cycle can be calculated by the Thom-Porteous formula.…
A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous…
We express nested Hilbert schemes of points and curves on a smooth projective surface as "virtual resolutions" of degeneracy loci of maps of vector bundles on smooth ambient spaces. We show how to modify the resulting obstruction theories…
The multiscale Monte-Carlo algorithm outlined in Bai and Brandt[1] is applied to a simple model of the polypeptide backbone. Effective coarse level Hamiltonians are derived by a fast Newtonian iterative scheme. The coarse Hamiltonian…