scientific article
From MaRDI portal
Publication:3655330
zbMath1181.65074MaRDI QIDQ3655330
Publication date: 7 January 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsnumerical examplespolynomial systemcomputational efficiencymultiplicity structureMacaulay matricesclosedness subspace method
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Multiplicity of solutions of equilibrium problems in solid mechanics (74G35) Approximation algorithms (68W25) Computational aspects in algebraic geometry (14Q99)
Related Items (13)
Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one ⋮ A certified iterative method for isolated singular roots ⋮ On the null spaces of the Macaulay matrix ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ Squarefree normal representation of zeros of zero-dimensional polynomial systems ⋮ Mechanism mobility and a local dimension test ⋮ Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Regeneration homotopies for solving systems of polynomials ⋮ Multiple zeros of nonlinear systems ⋮ Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms ⋮ Numerical Computation of the Hilbert Function and Regularity of a Zero Dimensional Scheme
Uses Software
This page was built for publication:
