Numerical Evidence for a Conjecture in Real Algebraic Geometry
From MaRDI portal
Publication:2743868
DOI10.1080/10586458.2000.10504645zbMath1054.14080OpenAlexW2057706156WikidataQ123308813 ScholiaQ123308813MaRDI QIDQ2743868
Publication date: 17 September 2001
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.em/1045952344
polynomial systemcontrol theoryflat deformationpole placement problemcheater's homotopynumerical Schubert calculuspolyhedral continuationSAGBI homotopy
Numerical computation of solutions to systems of equations (65H10) Real algebraic sets (14P05) Grassmannians, Schubert varieties, flag manifolds (14M15) Computational aspects of higher-dimensional varieties (14Q15)
Related Items
On total reality of meromorphic functions ⋮ Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro ⋮ The Secant Conjecture in the Real Schubert Calculus ⋮ The B. and M. Shapiro conjecture in real algebraic geometry and the Bethe ansatz ⋮ Frontiers of reality in Schubert calculus ⋮ Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On totally positive matrices
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Coefficient-parameter polynomial continuation
- Some remarks on real and complex output feedback
- Bézout number calculations for multi-homogeneous polynomial systems
- Polyhedral end games for polynomial continuation
- Numerical Schubert calculus
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods
- A theorem on random polynomials and some consequences in average complexity
- A reduction theorem for totally positive matrices
- Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
- Polynomial Equations and Convex Polytopes
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- Multivariable Nyquist criteria, root loci, and pole placement: A geometric viewpoint
- Nonlinear Homotopies for Solving Deficient Polynomial Systems with Parameters
- The Geometry of Algorithms with Orthogonality Constraints
- The special Schubert calculus is real
- On Dynamic Feedback Compensation and Compactification of Systems
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Realization by inspection
- Pieri Homotopies for Problems in Enumerative Geometry Applied to Pole Placement in Linear Systems Control
- Algorithm 795
- Numerical Polynomial Algebra
- Real rational curves in Grassmannians
- Newton's method for overdetermined systems of equations
- Totally positive matrices
- Algorithms in invariant theory
