Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
From MaRDI portal
Publication:765856
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
Cites work
- scientific article; zbMATH DE number 4214184 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 1254248 (Why is no real title available?)
- scientific article; zbMATH DE number 2151203 (Why is no real title available?)
- A Gröbner approach to involutive bases
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Computational Methods for the Construction of a Class of Noetherian Operators
- Computing the multiplicity structure from geometric involutive form
- Computing the multiplicity structure in solving polynomial systems
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Gröbner bases and primary decomposition of polynomial ideals
- Involutive bases of polynomial ideals
- Isolated points, duality and residues
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Multivariate polynomial system solving using intersections of eigenspaces.
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical calculation of the multiplicity of a solution to algebraic equations
- On multiplicities in polynomial system solving
- Quadratic Newton iteration for systems with multiplicity
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- The closedness subspace method for computing the multiplicity structure of a polynomial system
Cited in
(9)- Computing the multiplicity structure from geometric involutive form
- An improved method for evaluating Max Noether conditions: case of breadth one (extended abstract)
- Applications of Symbolic Calculations and Polynomial Invariants to the Classification of Singularities of Differential Systems
- 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)