On multiplicities in polynomial system solving

DOI10.1090/S0002-9947-96-01671-6zbMath0910.13009OpenAlexW1854819181MaRDI QIDQ4896203

Maria Grazia Marinari, Ferdinando Mora, Hans-Michael Möller

Publication date: 20 October 1996

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-96-01671-6

zbMATH Keywords

multiplicitiescomplexity boundsefficiency of algorithmssolving a system of polynomial equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Multiplicity theory and related topics (13H15) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Infinitesimal methods in algebraic geometry (14B10)

Related Items (25)

The Big Mother of all Dualities: Möller Algorithm ⋮ Efficient computation of dual space and directional multiplicity of an isolated point ⋮ The big mother of all dualities. 2: Macaulay bases ⋮ ON CONSTANT COEFFICIENT PDE SYSTEMS AND INTERSECTION MULTIPLICITIES ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ Gröbner Duality and multiple points in linearly general position ⋮ On the Noether and the Cayley-Bacharach theorems with PD multiplicities ⋮ Gröbner bases, H–bases and interpolation ⋮ The construction of Noetherian operators ⋮ Noetherian operators, primary submodules and symbolic powers ⋮ On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals ⋮ Eliminating dual spaces ⋮ Kernels of discrete convolutions and application to stationary subdivision operators ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Infinitely many quasi-coincidence point solutions of multivariate polynomial problems ⋮ Multivariate polynomial system solving using intersections of eigenspaces. ⋮ Newton's method with deflation for isolated singularities of polynomial systems ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ Multiple zeros of nonlinear systems ⋮ Evaluation techniques for zero-dimensional primary decomposition ⋮ Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms ⋮ Multivariate interpolation and standard bases for Macaulay modules ⋮ An ideal separating extension of affine space ⋮ Effective algorithm for computing Noetherian operators of zero-dimensional ideals ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets

Uses Software

• REDUCE

This page was built for publication: On multiplicities in polynomial system solving