A primal-dual formulation for certifiable computations in Schubert calculus

DOI10.1007/S10208-015-9270-ZzbMATH Open1360.14126arXiv1406.0864OpenAlexW2164322540MaRDI QIDQ330099FDOQ330099

Authors: Jonathan D. Hauenstein, Nickolas Hein, Frank Sottile 

Publication date: 24 October 2016

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Abstract: 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 of any Schubert problem on a Grassmannian or flag manifold as a system of bilinear equations with the same number of equations as variables. This formulation enables numerical computations in the Schubert calculus to be certified using algorithms based on Smale's alpha-theory.

Full work available at URL: https://arxiv.org/abs/1406.0864

Recommendations

• A lifted square formulation for certifiable Schubert calculus
• Experimentation at the Frontiers of Reality in Schubert Calculus
• Numerical Schubert calculus
• Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm
• Numerical Schubert Calculus by the Pieri Homotopy Algorithm

zbMATH Keywords

Schubert calculuscertificationsquare systems

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Classical problems, Schubert calculus (14N15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Cites Work

• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Title not available (Why is that?)
• Title not available (Why is that?)
• Real solutions to equations from geometry
• Software for numerical algebraic geometry: a paradigm and progress towards its implementation
• Schubert calculus and representations of the general linear group
• Title not available (Why is that?)
• Rational functions with real critical points and the B. and M. Shapiro conjecture in real enumerative geometry
• Multihomogeneous Newton methods
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Algorithm 921: alphaCertified: certifying solutions to polynomial systems
• Complexity of Bezout's Theorem I: Geometric Aspects
• Numerical Schubert calculus
• Robust certified numerical homotopy tracking
• Lower bounds in real Schubert calculus
• Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
• The monotone secant conjecture in the real Schubert calculus
• Certified numerical homotopy tracking
• Solving Schubert problems with Littlewood-Richardson homotopies
• Galois groups of Schubert problems via homotopy computation
• Experimentation and Conjectures in the Real Schubert Calculus for Flag Manifolds
• An a posteriori certification algorithm for Newton homotopies
• Complexity of path-following methods for the eigenvalue problem
• Experimentation in the Schubert calculus
• Lower bounds for numbers of real solutions in problems of Schubert calculus
• The Secant Conjecture in the Real Schubert Calculus
• Frontiers of reality in Schubert calculus
• The B. and M. Shapiro conjecture in real algebraic geometry and the Bethe ansatz

Cited In (6)

• Experimentation at the Frontiers of Reality in Schubert Calculus
• Classification of Schubert Galois groups in \(Gr(4, 9)\)
• A lifted square formulation for certifiable Schubert calculus
• Numerical Schubert Calculus by the Pieri Homotopy Algorithm
• Certification for polynomial systems via square subsystems
• Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm

Uses Software

• Bertini
• alphaCertified

This page was built for publication: A primal-dual formulation for certifiable computations in Schubert calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330099)