Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
DOI10.1016/J.JSC.2011.10.001zbMATH Open1237.13054OpenAlexW2061965397MaRDI QIDQ765856FDOQ765856
Authors: Lihong Zhi, Xiao-Li Wu 
Publication date: 22 March 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.10.001
Recommendations
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Computing singular solutions to polynomial systems
- Symbolic-numeric methods on computing isolated singular solutions of algebraic systems
- Applications of Symbolic Calculations and Polynomial Invariants to the Classification of Singularities of Differential Systems
- Symbolic-numeric methods for solving polynomial equations and applications
- On Solvability of Systems of Symbolic Polynomial Equations
- Publication:4723253
- The complexity and geometry of numerically solving polynomial systems
- Computation of the characteristic variety and the singular locus of a system of differential equations with polynomial coefficients
- Computing isolated singular solutions of polynomial systems: case of breadth one
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Solving polynomial systems; resultants (13P15)
Cites Work
- Involutive bases of polynomial ideals
- A Gröbner approach to involutive bases
- 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
- Computing the multiplicity structure from geometric involutive form
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Gröbner bases and primary decomposition of polynomial ideals
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Title not available (Why is that?)
- The closedness subspace method for computing the multiplicity structure of a polynomial system
- Title not available (Why is that?)
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Numerical calculation of the multiplicity of a solution to algebraic equations
- On multiplicities in polynomial system solving
- Computational Methods for the Construction of a Class of Noetherian Operators
- Multivariate polynomial system solving using intersections of eigenspaces.
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Title not available (Why is that?)
Cited In (9)
- Computing the multiplicity structure from geometric involutive form
- Applications of Symbolic Calculations and Polynomial Invariants to the Classification of Singularities of Differential Systems
- An improved method for evaluating Max Noether conditions: case of breadth one (extended abstract)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Computing singular solutions to polynomial systems
- Symbolic-numeric methods on computing isolated singular solutions of algebraic systems
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
This page was built for publication: Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765856)
