Computer Science > Symbolic Computation
[Submitted on 1 Apr 2023 (v1), last revised 9 May 2023 (this version, v2)]
Title:Two Variants of Bezout Subresultants for Several Univariate Polynomials
View PDFAbstract:In this paper, we develop two variants of Bezout subresultant formulas for several polynomials, i.e., hybrid Bezout subresultant polynomial and non-homogeneous Bezout subresultant polynomial. Rather than simply extending the variants of Bezout subresultant formulas developed by Diaz-Toca and Gonzalez-Vega in 2004 for two polynomials to arbitrary number of polynomials, we propose a new approach to formulating two variants of the Bezout-type subresultant polynomials for a set of univariate polynomials. Experimental results show that the Bezout-type subresultant formulas behave better than other known formulas when used to compute multi-polynomial subresultants, among which the non-homogeneous Bezout-type formula shows the best performance.
Submission history
From: Jing Yang [view email][v1] Sat, 1 Apr 2023 08:38:06 UTC (177 KB)
[v2] Tue, 9 May 2023 00:58:06 UTC (177 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.