Newton's method with deflation for isolated singularities of polynomial systems
DOI10.1016/j.tcs.2006.02.018zbMath1106.65046arXivmath/0408419OpenAlexW2071860648MaRDI QIDQ2503291
Anton Leykin, Ailing Zhao, Jan Verschelde
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0408419
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)
Related Items
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
- Unnamed Item
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Modified deflation algorithm for the solution of singular problems. II: Nonlinear multipoint boundary value problems
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- On location and approximation of clusters of zeros: Case of embedding dimension one
- A numerical method for branch points of a system of nonlinear algebraic equations
- Automatic differentiation: techniques and applications
- A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
- Higher order turning points
- Isolated points, duality and residues
- Mixed volume computation for semi-mixed systems
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- Quadratic Newton iteration for systems with multiplicity
- Advances and improvements in the theory of standard bases and syzygies
- On location and approximation of clusters of zeros of analytic functions
- UTV Expansin pack: Special-purpose rank-revealing algorithms
- Lines tangent to $2n-2$ spheres in ${\mathbb R}^n$
- 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
- Efficient Numerical Pathfollowing Beyond Critical Points
- Efficient Computation of Singular Points
- Newton’s Method at Singular Points. II
- Gröbner Duality and multiple points in linearly general position
- Numerical calculation of the multiplicity of a solution to algebraic equations
- Introduction to Numerical Continuation Methods
- Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
- Algorithm 795
- Numerical Polynomial Algebra
- Historical Development of the Newton–Raphson Method
- On multiplicities in polynomial system solving
- Numerical Methods for Bifurcations of Dynamical Equilibria
- Iterative Solution of Nonlinear Equations in Several Variables
- Newton's method for overdetermined systems of equations
- Computing the multiplicity structure in solving polynomial systems
- Solving Real Polynomial Systems with Real Homotopies
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- A Rank-Revealing Method with Updating, Downdating, and Applications
- A Tree-based analysis of a family of augmented systems for the computation of singular points
- Finding mixed cells in the mixed volume computation