Resultant elimination via implicit equation interpolation
type: Item
instance of: scholarly article
title: Resultant elimination via implicit equation interpolation
zbMATH Open document ID: 1390.13082
author: Min Tang
author: Zhengfeng Yang
author: Zhenbing Zeng
published in: Journal of Systems Science and Complexity
publication date: 2018-01-25T00:00:00Z
review text: Solving multivariate polynomial systems is a fundamental problem in Engineering and Science and many methods have developed hitherto. Elimination method via resultants is undoubtably one of the most known but it implies difficult symbolic tasks as computations of determinants of matrices whose elements are all polynomials, and factorizations of multivariate polynomials. In this paper, to overcome these problems, they combine multivariate rational function interpolation with resultant elimination to compute a kind of implicit equation, taking advantages of the good specialization of resultants. The efficiency of the method described in the article is showed in the fifth section on three unsolved combinatorial geometric problems.
reviewed by: Gema Maria Diaz Toca
Mathematics Subject Classification ID: 13P15
Mathematics Subject Classification ID: 26C15
zbMATH DE Number: 6829745
zbMATH Keywords: Interpolation of multivariate rational functions
zbMATH Keywords: implicit equations
zbMATH Keywords: hybrid symbolic-numeric computation
zbMATH Keywords: resultant elimination
describes a project that uses: F5C
MaRDI profile type: Publication
full work available at URL: s11424-016-4159-8
OpenAlex ID: W2531059567
cites work: Wu's method and its application to perspective viewing
cites work: Q3491012
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: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: A new proof for the correctness of the F5 algorithm
cites work: F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
cites work: Q4660688
cites work: Q3374924
cites work: A new incremental algorithm for computing Groebner bases
cites work: An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
cites work: An efficient method for computing comprehensive Gröbner bases
cites work: A new algorithmic scheme for computing characteristic sets
cites work: Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
cites work: Fast computation of the Bézout and Dixon resultant matrices
cites work: Multipolynomial resultant algorithms
cites work: Q4234291
cites work: Q4023642
cites work: Macaulay style formulas for sparse resultants
cites work: Q4336109
cites work: A generic position based method for real root isolation of zero-dimensional polynomial systems
cites work: Q3851616
cites work: Early termination in sparse interpolation algorithms
cites work: Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
cites work: Sparse interpolation of multivariate rational functions
cites work: Q5301671
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: A Property of a Triangle Inscribed in a Convex Curve
DOI: 10.1007/S11424-016-4159-8
description: scientific article; zbMATH DE number 6829745