Efficient computation of dual space and directional multiplicity of an isolated point
type: Item
instance of: scholarly article
title: Efficient computation of dual space and directional multiplicity of an isolated point
zbMATH Open document ID: 1418.65025
author: Angelos Mantzaflaris
author: Hamid Rahkooy
author: Zafeirakis Zafeirakopoulos
published in: Computer Aided Geometric Design
publication date: 2018-12-18T00:00:00Z
full work available at URL: dir-mult.pdf
Mathematics Subject Classification ID: 65D17
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 14Q05
zbMATH DE Number: 6994917
zbMATH Keywords: multiplicity structure
zbMATH Keywords: dual space
zbMATH Keywords: directional multiplicity
zbMATH Keywords: Gröbner basis
zbMATH Keywords: algebraic curves
MaRDI profile type: Publication
OpenAlex ID: W2357658017
cites work: Topology and arrangement computation of semi-algebraic planar curves
cites work: Topology of 2D and 3D rational curves
cites work: A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
cites work: 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
cites work: Q4394981
cites work: Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values''
cites work: Computing the multiplicity structure in solving polynomial systems
cites work: Using implicit equations of parametric curves and surfaces without computing them: Polynomial algebra by values
cites work: Introduction to the solution of polynomial systems
cites work: Matrices in elimination theory
cites work: Q4293510
cites work: Certifying isolated singular points and their multiplicity structure
cites work: Computing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner bases
cites work: NUMERICAL ALGORITHMS FOR DUAL BASES OF POSITIVE-DIMENSIONAL IDEALS
cites work: Q5447284
cites work: Computing isolated singular solutions of polynomial systems: case of breadth one
cites work: Computing the multiplicity structure of an isolated singular solution: case of breadth one
cites work: Computing the nearest singular univariate polynomials with given root multiplicities
cites work: Verified error bounds for isolated singular solutions of polynomial systems
cites work: Q4293528
cites work: Computation of singularities and intersections of offsets of planar curves
cites work: Deflation and certified isolation of singular zeros of polynomial systems
cites work: Singular Zeros of Polynomial Systems
cites work: Q4227291
cites work: On multiplicities in polynomial system solving
cites work: Isolated points, duality and residues
cites work: Using resultants for inductive Gröbner bases computation
cites work: Numerical Polynomial Algebra
cites work: Q3997666
cites work: Q3997667
cites work: Computing the multiplicity structure from geometric involutive form
cites work: Q3655330
DOI: 10.1016/J.CAGD.2016.05.002
Recommended article: Efficient Computation of Singular Points
Recommended article: Computing the real isolated points of an algebraic hypersurface
Recommended article: Q4323618
Recommended article: Dual vectors and lower bounds for the nearest lattice point problem
Recommended article: Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
Recommended article: Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
Recommended article: Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
Recommended article: A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
Recommended article: Q3717209
Recommended article: Q3178097
description: scientific article; zbMATH DE number 6994917