An alternative algorithm for computing the pseudo-remainder of multivariate polynomials

DOI10.1016/j.amc.2005.04.087zbMath1092.65018OpenAlexW2014046524MaRDI QIDQ2489188

Yongbin Li

Publication date: 16 May 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.087

zbMATH Keywords

Gaussian eliminationNumerical examplesMultivariate polynomialDeterminant of a matrixPseudo-remainder

Mathematics Subject Classification ID

Related Items (2)

A new approach for constructing subresultants ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries

Uses Software

• Maple

Cites Work

• Elimination methods
• A new method for solving algebraic systems of positive dimension
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• Decomposing polynomial systems into simple systems
• Computing triangular systems and regular systems
• Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An alternative algorithm for computing the pseudo-remainder of multivariate polynomials