Related papers: Numerical Schubert Calculus via the Littlewood-Ric…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…
J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert…
This paper presents a systematic approach for computing local solutions to motion planning problems in non-convex environments using numerical optimal control techniques. It extends the range of use of state-of-the-art numerical optimal…
Schubert calculus provides algebraic tools to solve enumerative problems. There have been several applied problems in systems theory, linear algebra and physics which were studied by means of Schubert calculus. The method is most powerful…
A driving question in (quantum) cohomology of flag varieties is to find non-recursive, positive combinatorial formulas for expressing the product of two classes in a particularly nice basis, called the Schubert basis. Bertram,…
We present a method to approximately solve general instances of combinatorial optimization problems using the physical dynamics of 3d rotors obeying Landau-Lifshitz-Gilbert dynamics. Conventional techniques to solve discrete optimization…
Littlewood-Richardson rule gives the decomposition formula for the multiplication of two Schur functions, while the decomposition formula for the multiplication of two Hall-Littlewood functions or two universal characters is also given by…
The problem of finding roots or solutions of a nonlinear partial differential equation may be formulated as the problem of minimizing a sum of squared residuals. One then defines an evolution equation so that in the asymptotic limit a…
We give a new Littlewood-Richardson rule for the Schubert structure coefficients of isotropic Grassmannians, equivalently for the multiplication of $P$-Schur functions. Serrano (2010) previously gave a formula in terms of classes in his…
Quantum scientific computing is to solve engineering and science problems such as simulation and optimization on quantum computers. Solving ordinary and partial differential equations (PDEs) is essential in simulations. However, existing…
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…
The effective and efficient numerical solution of Riemann-Hilbert problems has been demonstrated in recent work. With the aid of ideas from the method of nonlinear steepest descent for Riemann-Hilbert problems, the resulting numerical…
Grover's algorithm can be employed in global optimization methods providing, in some cases, a quadratic speedup over classical algorithms. This paper describes a new method for continuous global optimization problems that uses a classical…
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is…
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…
We show how to use Clifford algebra techniques to describe the de Rham cohomology ring of equal rank compact symmetric spaces $G/K$. In particular, for $G/K=U(n)/U(k)\times U(n-k)$, we obtain a new way of multiplying Schur polynomials,…
We give a combinatorial rule for computing intersection numbers on a flag manifold which come from products of Schubert classes pulled back from Grassmannian projections. This rule generalizes the known rule for Grassmannians.
We study scattering equations of hyperplane arrangements from the perspective of combinatorial commutative algebra and numerical algebraic geometry. We formulate the problem as linear equations on a reciprocal linear space and develop a…