Fast computation of the Bézout and Dixon resultant matrices
type: Item
instance of: scholarly article
title: Fast computation of the Bézout and Dixon resultant matrices
zbMATH Open document ID: 0996.65046
author: R. Smith
published in: Journal of Symbolic Computation
publication date: 2002-06-11T00:00:00Z
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 12D10
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1753635
zbMATH Keywords: common root of polynomials
zbMATH Keywords: Gröbner bases
zbMATH Keywords: computer algebra systems
zbMATH Keywords: MAPLE
zbMATH Keywords: MATHEMATICA
zbMATH Keywords: performance
zbMATH Keywords: Bézout resultant matrix
zbMATH Keywords: Dixon-Cayley resultant matrix
zbMATH Keywords: algorithm
describes a project that uses: Maple
describes a project that uses: Mathematica
MaRDI profile type: Publication
full work available at URL: jsco.2001.0462
OpenAlex ID: W1981613180
cites work: Concise parallel Dixon determinant
cites work: Subresultants and Reduced Polynomial Remainder Sequences
cites work: Q4209232
cites work: Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
cites work: Bézoutians
cites work: The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
cites work: Inertia characteristics of self-adjoint matrix polynomials
cites work: Multipolynomial resultant algorithms
cites work: The Cayley method in computer aided geometric design
cites work: Q4494299
DOI: 10.1006/JSCO.2001.0462
description: scientific article; zbMATH DE number 1753635