Related papers: Numerical Schubert calculus
The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural…
We use classical invariant theory to construct invariants of complex graded Gorenstein algebras of finite vector space dimension. As a consequence, we obtain a way of extracting certain numerical invariants of quasi-homogeneous isolated…
What is the optimal way to deform a projective hypersurface into another one? In this paper we will answer this question adopting the point of view of measure theory, introducing the optimal transport problem between complex algebraic…
We introduce optimal quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. Using the homotopy continuation concept [6] that transforms optimal quadrature rules from…
Let $Q$ be a quiver, $M$ a representation of $Q$ with an ordered basis $\cB$ and $\ue$ a dimension vector for $Q$. In this note we extend the methods of \cite{L12} to establish Schubert decompositions of quiver Grassmannians $\Gr_\ue(M)$…
We study the arc space of the Grassmannian from the point of view of the singularities of Schubert varieties. Our main tool is a decomposition of the arc space of the Grassmannian that resembles the Schubert cell decomposition of the…
A fast and accurate numerical method for the solution of scalar and matrix Wiener--Hopf problems is presented. The Wiener--Hopf problems are formulated as Riemann--Hilbert problems on the real line, and a numerical approach developed for…
A regular nilpotent Hessenberg Schubert cell is the intersection of a regular nilpotent Hessenberg variety with a Schubert cell. In this paper, we describe a set of minimal generators of the defining ideal of a regular nilpotent Hessenberg…
The Schr\" odinger equations which are exactly solvable in terms of associated special functions are directly related to some self-adjoint operators defined in the theory of hypergeometric type equations. The fundamental formulae occurring…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
The stability and convergence rate of Olver's collocation method for the numerical solution of Riemann-Hilbert problems (RHPs) is known to depend very sensitively on the particular choice of contours used as data of the RHP. By manually…
The Mukhin-Tarasov-Varchenko Theorem (previously the Shapiro Conjecture) asserts that a Schubert problem has all solutions distinct and real if the Schubert varieties involved osculate a rational normal curve at real points. This sparked…
We give the formula for multiplying a Schubert class on an odd orthogonal or symplectic flag manifold by a special Schubert class pulled back from a Grassmannian of maximal isotropic subspaces. This is also the formula for multiplying a…
In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other problem classes including certain mathematical programs under…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-valued mapping defined upon the Huber…
In this work numerical methods for solving Einstein's equations are developed and applied to the study of inhomogeneous cosmological models. A two-dimensional computer code is described which implements two advanced numerical methods:…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…
The basic mathematical framework for super Hilbert spaces over a Grassmann algebra with a Grassmann number-valued inner product is formulated. Super Hilbert spaces over infinitely generated Grassmann algebras arise in the functional…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…