On isolation of simple multiple zeros and clusters of zeros of polynomial systems
From MaRDI portal
(Redirected from Publication:5207445)
Software, source code, etc. for problems pertaining to several complex variables and analytic spaces (32-04) Complex singularities (32S99) Numerical computation of solutions to systems of equations (65H10) Symbolic computation and algebraic computation (68W30) Multiplicity of solutions of equilibrium problems in solid mechanics (74G35)
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
Cites work
- 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
- Certifying isolated singular points and their multiplicity structure
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- Computing isolated singular solutions of polynomial systems: case of breadth one
- Computing the multiplicity structure in solving polynomial systems
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Convergence Acceleration for Newton’s Method at Singular Points
- Convergence of the Newton process to multiple solutions
- Convergence Rates for Newton’s Method at Singular Points
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- 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
- Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
- Existence verification for singular and nonsmooth zeros of real nonlinear systems
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Finding a cluster of zeros of univariate polynomials
- scientific article; zbMATH DE number 3900059 (Why is no real title available?)
- scientific article; zbMATH DE number 1254248 (Why is no real title available?)
- scientific article; zbMATH DE number 1096865 (Why is no real title available?)
- scientific article; zbMATH DE number 1372782 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 1859224 (Why is no real title available?)
- scientific article; zbMATH DE number 5245181 (Why is no real title available?)
- Isolated points, duality and residues
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Most tensor problems are NP-hard
- Multiple zeros of nonlinear systems
- Newton's method and high order singularities
- Newton’s Method at Singular Points. I
- Newton’s Method at Singular Points. II
- Newton's method for singular nonlinear equations using approximate left and right nullspaces of the Jacobian
- Newton’s Method for Singular Problems when the Dimension of the Null Space is $>1$
- Newton's method with deflation for isolated singularities of polynomial systems
- Nuclear norm of higher-order tensors
- Numerical approximation of multiple isolated roots of analytical systems
- Numerical Polynomial Algebra
- On deflation and multiplicity structure
- On location and approximation of clusters of zeros of analytic functions
- On location and approximation of clusters of zeros: Case of embedding dimension one
- On Newton’s Method for Singular Problems
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions
- Quadratic Newton iteration for systems with multiplicity
- Residue currents and Bezout identities
- Solving rank-deficient separable nonlinear equations
- The DMM bound: multivariate (aggregate) separation bounds
- The fundamental theorem of algebra and complexity theory
- Verified error bounds for isolated singular solutions of polynomial systems
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
- Verified error bounds for multiple roots of systems of nonlinear equations
Cited in
(9)- A heuristic method for certifying isolated zeros of polynomial systems
- Locating the closest singularity in a polynomial homotopy
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- scientific article; zbMATH DE number 1254284 (Why is no real title available?)
- scientific article; zbMATH DE number 6103907 (Why is no real title available?)
- Isolating clusters of zeros of analytic systems using arbitrary-degree inflation
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Inflation of poorly conditioned zeros of systems of analytic functions
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)
