Computing the multiplicity structure from geometric involutive form
From MaRDI portal
Publication:5301639
DOI10.1145/1390768.1390812zbMath1236.68302OpenAlexW2035256983MaRDI QIDQ5301639
Publication date: 20 January 2009
Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1390768.1390812
Related Items (11)
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Improved two-step Newton's method for computing simple multiple zeros of polynomial systems ⋮ Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one ⋮ A certified iterative method for isolated singular roots ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Nearest multivariate system with given root multiplicities ⋮ Multiple zeros of nonlinear systems ⋮ Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms ⋮ Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
This page was built for publication: Computing the multiplicity structure from geometric involutive form
