Related papers: Numerical Schubert Calculus via the Littlewood-Ric…
We propose a combinatorial model for the Schubert structure constants of the complete flag manifold when one of the factors is Grassmannian.
We survey some results on Lipschitz and Schauder regularity estimates for viscous Hamilton--Jacobi equations with subcritical L\'evy diffusions. The Schauder estimates, along with existence of smooth solutions, are obtained with the help of…
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 usually involves more equations than variables. Using reduction to the diagonal, we previously…
It is well-known that the intersection multiplicities of Schubert classes in the Grassmanian are Littlewood-Richardson coefficients. We generalize this statement in the context of quiver representations. Here the intersection multiplicity…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…
This paper introduces a subgradient extragradient algorithm with a conjugate gradient-type direction to solve pseudomonotone variational inequality problems in Hilbert spaces. The algorithm features a self-adaptive strategy that eliminates…
We propose a discontinuous least squares finite element method for solving the Helmholtz equation. The method is based on the L2 norm least squares functional with the weak imposition of the continuity across the interior faces as well as…
Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…
Stochastic contact Hamiltonian systems are a class of important mathematical models, which can describe the dissipative properties with odd dimensions in the stochastic environment. In this article, we investigate the numerical dynamics of…
This paper solves the Sylvester equation in the form of AX+XB=C in a distributed way, and proposes three distributed continuous-time algorithms for three cases. We start with the basic algorithm for solving a least squares solution of the…
The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…
In this paper we study iterative algorithms for finding a common element of the set of fixed points of $\kappa$-strict pseudocontractions or finding a solution of a variational inequality problem for a monotone, Lipschitz continuous…
The problem of computing products of Schubert classes in the cohomology ring can be formulated as the problem of expanding skew Schur polynomials into the basis of ordinary Schur polynomials. In contrast, the problem of computing the…
We provide several ingredients towards a generalization of the Littlewood-Richardson rule from Chow groups to algebraic cobordism. In particular, we prove a simple product-formula for multiplying classes of smooth Schubert varieties with…
We present a general method for constructing real solutions to some problems in enumerative geometry which gives lower bounds on the maximum number of real solutions. We apply this method to show that two new classes of enumerative…
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…
A strengthened form of Schur's triangularization theorem is given for quaternion matrices with real spectrum (for complex matrices it was given by Littlewood). Littlewood's algorithm for reducing a complex matrix to a canonical form under…
We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
In this paper, we revisit the classical problem of solving over-determined systems of nonsmooth equations numerically. We suggest a nonsmooth Levenberg--Marquardt method for its solution which, in contrast to the existing literature, does…