Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
Consider a polynomial system \(F = \{f_1,\dots,f_t\} \subset \mathbb{C}[x_1,\dots, x_s]\) which has an isolated singularity at \(\hat{\mathbf{x}} = (\hat{x}_1, \dots, \hat{x}_s)\). The authors of the paper study the singularity by computing (a) the exponent \(\rho\) in the primary component \(Q=\langle f_1,\dots, f_t, P^\rho \rangle\), where \(P\) is the maximal prime corresponding to~\(\hat{\mathbf{x}}\), (b) the \(\mathbb{C}\)-dimension \(\mu\) of \(\mathbb{C}[\mathbf{x}]/Q\), and (c) a basis of the space of differential operators that annihilates \(\langle f_1, \dots, f_t \rangle\) locally at \(\hat{\mathbf{x}}\) (dubbed the \textit{Max-Noether space}). The paper at hand focusses on precision and complexity questions of the symbolic-numeric procedure introduced earlier by the authors [in: ISSAC 2008, 325--332, ACM, New York (2008; Zbl 1236.68302)]. The unsurprising result is that the algorithm has the same complexity as computing the nullspace of a matrix, bounded in terms of the dimension of the matrix.
- 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
- 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
- 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?)
- 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
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Computing singular solutions to polynomial systems
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- An improved method for evaluating Max Noether conditions: case of breadth one (extended abstract)
- 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
- 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
- Computing the multiplicity structure from geometric involutive form
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)
