A lifted square formulation for certifiable Schubert calculus
From MaRDI portal
Publication:507165
DOI10.1016/j.jsc.2016.07.021zbMath1356.14043arXiv1504.00979OpenAlexW2962940795MaRDI QIDQ507165
Nickolas Hein, Frank J. Sottile
Publication date: 3 February 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.00979
Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Classical problems, Schubert calculus (14N15)
Related Items (4)
Certification for polynomial systems via square subsystems ⋮ Classification of Schubert Galois groups in \(Gr(4, 9)\) ⋮ Foreword. What is numerical algebraic geometry? ⋮ Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual formulation for certifiable computations in Schubert calculus
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Schubert induction
- Certified predictor-corrector tracking for Newton homotopies
- Flags, Schubert polynomials, degeneracy loci, and determinantal formulas
- Robust certified numerical homotopy tracking
- Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
- Certified Numerical Homotopy Tracking
- Algorithm 921
- Galois groups of Schubert problems via homotopy computation
- Experimentation in the Schubert Calculus
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
This page was built for publication: A lifted square formulation for certifiable Schubert calculus