Efficient computation of dual space and directional multiplicity of an isolated point
From MaRDI portal
Publication:1634816
DOI10.1016/j.cagd.2016.05.002zbMath1418.65025OpenAlexW2357658017MaRDI QIDQ1634816
Hamid Rahkooy, Angelos Mantzaflaris, Zafeirakis Zafeirakopoulos
Publication date: 18 December 2018
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01214195v2/file/dir-mult.pdf
Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic curves (14Q05) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
Subresultants and the Shape Lemma, Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest singular univariate polynomials with given root multiplicities
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Computing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner bases
- Topology of 2D and 3D rational curves
- Topology and arrangement computation of semi-algebraic planar curves
- Introduction to the solution of polynomial systems
- Computation of singularities and intersections of offsets of planar curves
- Isolated points, duality and residues
- Matrices in elimination theory
- Using implicit equations of parametric curves and surfaces without computing them: Polynomial algebra by values
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Certifying Isolated Singular Points and their Multiplicity Structure
- Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
- Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems
- Singular Zeros of Polynomial Systems
- Numerical Polynomial Algebra
- On multiplicities in polynomial system solving
- NUMERICAL ALGORITHMS FOR DUAL BASES OF POSITIVE-DIMENSIONAL IDEALS
- Using resultants for inductive Gröbner bases computation
- Deflation and certified isolation of singular zeros of polynomial systems
- Computing the multiplicity structure in solving polynomial systems
- Computing the multiplicity structure from geometric involutive form
