Results 41 to 50 of about 187 (52)
An elementary approach to subresultants theory
Journal of Symbolic Computation, 2003 In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of the known results of subresultants are recovered, some with more precision, without using Euclidean divisions or existence of roots for univariate ...
M'Hammed El Kahoui
exaly +1 more source
The Habicht Approach to Subresultants [PDF]
Journal of Symbolic Computation, 1996 The Habicht approach to the theory of subresultants is based on studying polynomial remainder sequences (PRS) with indeterminate coefficients, and predicting the effects of specializing these coefficients. This has advantages as noted by Loos.
CHEE KENG YAP +3 more
exaly +2 more sources
Closed formula for univariate subresultants in multiple roots [PDF]
Linear Algebra and Its Applications, 2019 We generalize Sylvester single sums to multisets and show that these sums compute subresultants of two univariate polynomials as a function of their roots independently of their multiplicity structure.
Teresa Krick +2 more
exaly +2 more sources
New Structure Theorem for Subresultants [PDF]
Journal of Symbolic Computation, 2000 We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and τ a bound on the bitsize of the minors extracted from Sylvester matrix, our ...
Mohab Safey El Din +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Subresultants and generic monomial bases
Journal of Symbolic Computation, 2005Gabriela Tali Jerónimo
exaly
Double Sylvester sums for subresultants and multi-Schur functions
Journal of Symbolic Computation, 2003Alain Lascoux, Piotr Pragacz
exaly
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM, 1971J F Traub, W S Brown
exaly