Fast computation of the Bézout and Dixon resultant matrices

DOI10.1006/jsco.2001.0462zbMath0996.65046OpenAlexW1981613180MaRDI QIDQ1599530

R. Smith

Publication date: 11 June 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0462

zbMATH Keywords

performancealgorithmGröbner basescomputer algebra systemsMATHEMATICAMAPLEBézout resultant matrixcommon root of polynomialsDixon-Cayley resultant matrix

Mathematics Subject Classification ID

Related Items (14)

Complexity of constructing Dixon resultant matrix ⋮ Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces ⋮ A recursive algorithm for constructing complicated Dixon matrices ⋮ Resultant elimination via implicit equation interpolation ⋮ Efficient computation of moving planes for rational parametric surfaces with base points using Dixon resultants ⋮ Kukles revisited: Advances in computing techniques ⋮ Computing the Dixon Resultant with the Maple Package DR ⋮ Parallel computation of real solving bivariate polynomial systems by zero-matching method ⋮ Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients ⋮ Computing the intersection of two ruled surfaces by using a new algebraic approach ⋮ On the minors of the implicitization Bézout matrix for a rational plane curve ⋮ Numerical Instability of Resultant Methods for Multidimensional Rootfinding ⋮ Division-free computation of subresultants using Bezout matrices ⋮ Computations of multi-resultant with mechanization

Uses Software

• Maple
• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Inertia characteristics of self-adjoint matrix polynomials
• The Cayley method in computer aided geometric design
• Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
• Multipolynomial resultant algorithms
• Concise parallel Dixon determinant
• Bézoutians
• The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
• Subresultants and Reduced Polynomial Remainder Sequences

This page was built for publication: Fast computation of the Bézout and Dixon resultant matrices