Related papers: Numerical Schubert Calculus via the Littlewood-Ric…
We present a new numerical homotopy continuation algorithm for finding all solutions to Schubert problems on Grassmannians. This Littlewood-Richardson homotopy is based on Vakil's geometric proof of the Littlewood-Richardson rule. Its start…
We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…
The Macaulay2 package NumericalSchubertCalculus provides methods for the numerical computation of Schubert problems on Grassmannians. It implements both the Pieri homotopy algorithm and the Littlewood-Richardson homotopy algorithm. Each…
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
A solution is given to the following problem: how to compute the multiplicity, or more generally the Hilbert function, at a point on a Schubert variety in an orthogonal Grassmannian. Standard monomial theory is applied to translate the…
We study numerical methods for the solution of general linear moment problems, where the solution belongs to a family of nested subspaces of a Hilbert space. Multi-level algorithms, based on the conjugate gradient method and the…
We describe an explicit geometric Littlewood-Richardson rule, interpreted as deforming the intersection of two Schubert varieties so that they break into Schubert varieties. There are no restrictions on the base field, and all…
Traditional formulations of geometric problems from the Schubert calculus, either in Plucker coordinates or in local coordinates provided by Schubert cells, yield systems of polynomials that are typically far from complete intersections and…
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…
We study the T-equivariant quantum cohomology of the Grassmannian. We prove the vanishing of a certain class of equivariant quantum Littlewood-Richardson coefficients, which implies an equivariant quantum Pieri rule. As in the equivariant…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
Formulating a Schubert problem as the solutions to a system of equations in either Pl\"ucker space or in the local coordinates of a Schubert cell typically involves more equations than variables. We present a novel primal-dual formulation…
In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…
We recall the root game, introduced in an earlier paper, which gives a fairly powerful sufficient condition for non-vanishing of Schubert calculus on a generalised flag manifold G/B. We show that it gives a necessary and sufficient rule for…
In this paper, we propose a numerical method to solve the classic $L^2$-optimal transport problem. Our algorithm is based on use of multiple shooting, in combination with a continuation procedure, to solve the boundary value problem…
Based on an isomorphism between Grossman Larson Hopf algebra and Tensor Hopf algebra, we apply a sub-Riemannian geometry technique to branched rough differential equations and obtain the explicit Lipschitz continuity of the solution with…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
This paper offers a contemporary and comprehensive perspective on the classical algorithms utilized for the solution of minimum-time problem for linear systems (MTPLS). The use of unified notations supported by visual geometric…
In a previous work, the author and D.C. Dobson proposed a numerical method for solving the complex Helmholtz equation based on the minimization variational principles developed by Milton, Seppecher, and Bouchitte. This method results in a…