Computing singular solutions to polynomial systems
From MaRDI portal
Publication:1201933
DOI10.1016/0196-8858(92)90014-NzbMath0764.65030MaRDI QIDQ1201933
Alexander P. Morgan, Charles W. Wampler, Andrew John Sommese
Publication date: 17 January 1993
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)
Related Items
Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods, PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems, A homotopy method based on WENO schemes for solving steady state problems of hyperbolic conservation laws, Cell decomposition of almost smooth real algebraic surfaces, Improved two-step Newton's method for computing simple multiple zeros of polynomial systems, Isosingular sets and deflation, A comparison of homotopies for alternative formulations of the \(L^ 2\) optimal model order reduction problem, Numerically computing real points on algebraic sets, Unification and extension of intersection algorithms in numerical algebraic geometry, Foreword. What is numerical algebraic geometry?, A power series method for computing singular solutions to nonlinear analytic systems, Nearest multivariate system with given root multiplicities, Numerical algebraic geometry and algebraic kinematics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving systems of polynomial equations by bounded and real homotopy
- On the monotone convergence of Newton's method
- A transformation to avoid solutions at infinity for polynomial systems
- A homotopy for solving polynomial systems
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Computing all solutions to polynomial systems using homotopy continuation
- On the solutions to polynomial systems obtained by homotopy methods
- Coefficient-parameter polynomial continuation
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- Complex analytic geometry
- Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
- A methodology for solving chemical equilibrium systems
- Convergence of the Newton process to multiple solutions
- Computing singular solutions to nonlinear analytic systems
- Numerical Solution of a Class of Deficient Polynomial Systems
- Algorithm 652
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- Analysis of Newton’s Method at Irregular Singularities
- A Method for Computing All Solutions to Systems of Polynomials Equations
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- Finding All Solutions to a System of Polynomial Equations
- Convergence Rates for Newton’s Method at Singular Points
- Broyden’s Method for a Class of Problems Having Singular Jacobian at the Root
- On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions
- A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
- Numerically determining solutions of systems of polynomial equations
- An Approach to Homotopy and Degree Theory
- Newton’s Method at Singular Points. I
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Newton’s Method at Singular Points. II
- Geometrically Isolated Nonisolated Solutions and Their Approximation
- On Newton’s Method for Singular Problems
- Determining All Solutions to Certain Systems of Nonlinear Equations
- Finding all solutions to polynomial systems and other systems of equations
- Finding all isolated solutions to polynomial systems using HOMPACK
