A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
decompositionalgorithmembeddinghomotopy continuationpolynomial systemmultivariate polynomialsnumerical algebraic geometryirreducible componentsgeneric points
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
- scientific article; zbMATH DE number 1726532 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 3288410 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- A criterion for detecting m-regularity
- Algorithm 835
- Computing multiple roots of inexact polynomials
- Computing the multiplicity structure in solving polynomial systems
- Lectures on Curves on an Algebraic Surface. (AM-59)
- Linear free resolutions and minimal multiplicity
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Numerical Polynomial Algebra
- Numerical calculation of the multiplicity of a solution to algebraic equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Efficient computation of dual space and directional multiplicity of an isolated point
- Multiplicity-preserving triangular set decomposition of two polynomials
- Numerical irreducible decomposition over a number field
- Numerical calculation of the multiplicity of a solution to algebraic equations
- Numerical algebraic geometry and algebraic kinematics
- Regeneration homotopies for solving systems of polynomials
- Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
- scientific article; zbMATH DE number 177496 (Why is no real title available?)
- Multiple zeros of nonlinear systems
- Mechanism mobility and a local dimension test
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Regularization and matrix computation in numerical polynomial algebra
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Numerical computation of the genus of an irreducible curve within an algebraic set
- Recovering exact results from inexact numerical data in algebraic geometry
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
This page was built for publication: A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507587)