On isolation of simple multiple zeros and clusters of zeros of polynomial systems
DOI10.1090/MCOM/3479OpenAlexW2953875342MaRDI QIDQ5207445FDOQ5207445
Authors:
Publication date: 27 December 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3479
Recommendations
- scientific article; zbMATH DE number 1254284
- Clustering complex zeros of triangular systems of polynomials
- Isolating clusters of zeros of analytic systems using arbitrary-degree inflation
- On the multiplicity of isolated roots of sparse polynomial systems
- Iterative methods for multiple zeros of a polynomial by clustering
- scientific article; zbMATH DE number 4080774
- An algorithm for finding all isolated zeros of polynomial systems
- Enclosing clusters of zeros of polynomials
- Finding a cluster of zeros of univariate polynomials
- On zeros of multilinear polynomials
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Multiplicity of solutions of equilibrium problems in solid mechanics (74G35) Complex singularities (32S99) Software, source code, etc. for problems pertaining to several complex variables and analytic spaces (32-04)
Cites Work
- Nuclear norm of higher-order tensors
- Most tensor problems are NP-hard
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Title not available (Why is that?)
- Isolated points, duality and residues
- Quadratic Newton iteration for systems with multiplicity
- Newton's method with deflation for isolated singularities of polynomial systems
- Title not available (Why is that?)
- Computing the multiplicity structure in solving polynomial systems
- Title not available (Why is that?)
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- The fundamental theorem of algebra and complexity theory
- Numerical Polynomial Algebra
- Title not available (Why is that?)
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- On location and approximation of clusters of zeros of analytic functions
- Residue currents and Bezout identities
- Multiple zeros of nonlinear systems
- Deflation and certified isolation of singular zeros of polynomial systems
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- On location and approximation of clusters of zeros: Case of embedding dimension one
- Newton's method and high order singularities
- Convergence of the Newton process to multiple solutions
- Computing isolated singular solutions of polynomial systems: case of breadth one
- Title not available (Why is that?)
- On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
- Newton’s Method at Singular Points. I
- Newton’s Method for Singular Problems when the Dimension of the Null Space is $>1$
- Newton’s Method at Singular Points. II
- Convergence Acceleration for Newton’s Method at Singular Points
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- On Newton’s Method for Singular Problems
- Newton's method for singular nonlinear equations using approximate left and right nullspaces of the Jacobian
- Verified error bounds for multiple roots of systems of nonlinear equations
- The DMM bound
- Convergence Rates for Newton’s Method at Singular Points
- Finding a cluster of zeros of univariate polynomials
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Certifying isolated singular points and their multiplicity structure
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- A numerical method for branch points of a system of nonlinear algebraic equations
- Title not available (Why is that?)
- Existence verification for singular and nonsmooth zeros of real nonlinear systems
- Verified error bounds for isolated singular solutions of polynomial systems
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- Solving rank-deficient separable nonlinear equations
- Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- On deflation and multiplicity structure
- Title not available (Why is that?)
- Numerical approximation of multiple isolated roots of analytical systems
Cited In (9)
- Inflation of poorly conditioned zeros of systems of analytic functions
- Locating the closest singularity in a polynomial homotopy
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Isolating clusters of zeros of analytic systems using arbitrary-degree inflation
- A heuristic method for certifying isolated zeros of polynomial systems
- Title not available (Why is that?)
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Title not available (Why is that?)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
This page was built for publication: On isolation of simple multiple zeros and clusters of zeros of polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207445)