Subresultants of Several Univariate Polynomials in Newton Basis

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Wang, Weidong, Yang, Jing
Formato: Preprint
Publicado: 2022
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866917771972968448
author Wang, Weidong
Yang, Jing
author_facet Wang, Weidong
Yang, Jing
contents In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that used in the input polynomials. To solve the problem, we devise a particular matrix with the help of the companion matrix of a polynomial in Newton basis. Meanwhile, the concept of determinantal polynomial in power basis for formulating subresultant polynomials is extended to that in Newton basis. It is proved that the generalized determinantal polynomial of the specially designed matrix provides a new formula for the subresultant polynomial in Newton basis, which is equivalent to the subresultant polynomial in power basis. Furthermore, we show an application of the new formula in devising a basis-preserving method for computing the gcd of several Newton polynomials.
format Preprint
id arxiv_https___arxiv_org_abs_2212_03422
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Subresultants of Several Univariate Polynomials in Newton Basis
Wang, Weidong
Yang, Jing
Symbolic Computation
Commutative Algebra
In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that used in the input polynomials. To solve the problem, we devise a particular matrix with the help of the companion matrix of a polynomial in Newton basis. Meanwhile, the concept of determinantal polynomial in power basis for formulating subresultant polynomials is extended to that in Newton basis. It is proved that the generalized determinantal polynomial of the specially designed matrix provides a new formula for the subresultant polynomial in Newton basis, which is equivalent to the subresultant polynomial in power basis. Furthermore, we show an application of the new formula in devising a basis-preserving method for computing the gcd of several Newton polynomials.
title Subresultants of Several Univariate Polynomials in Newton Basis
topic Symbolic Computation
Commutative Algebra
url https://arxiv.org/abs/2212.03422