A Product-Decomposition Bound for Bezout Numbers
From MaRDI portal
Publication:4852618
DOI10.1137/0732061zbMath0854.65038OpenAlexW2050292516MaRDI QIDQ4852618
Charles W. Wampler, Alexander P. Morgan, Andrew John Sommese
Publication date: 6 January 1997
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0732061
kinematicshomotopy continuationpolynomial systemnonsingular solutionsfour-bar linkagepolynomial continuationBézout numbersnine-point problemproduct-decomposition bound
Numerical computation of solutions to systems of equations (65H10) Kinematics of a rigid body (70B10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Real polynomials: location of zeros (26C10)
Related Items
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, HomPINNs: Homotopy physics-informed neural networks for learning multiple solutions of nonlinear elliptic differential equations, Mixed-volume computation by dynamic lifting applied to polynomial system solving, Multiprojective witness sets and a trace test, Newton-Okounkov bodies of chemical reaction systems, Computing multihomogeneous resultants using straight-line programs, The algebraic synthesis of a spatial TS chain for a prescribed acceleration task, Counting derangements and Nash equilibria, A parametric representation of totally mixed Nash equilibria, Regeneration homotopies for solving systems of polynomials, Deformation techniques for sparse systems, Numerical algebraic geometry and algebraic kinematics, Toric intersection theory for affine root counting, Finding all steady state solutions of chemical kinetic models, Probabilistic Saturations and Alt’s Problem
