Symmetric Subresultants and Applications

Details Symmetric Subresultants and Applications Symmetric Subresultants and Applications

2006-12-22

arxiv.org/abs/cs/0612119v2

Computer Science

Symbolic Computation

Scientific paper

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we show that they satisfy a structure theorem which allows us to compute them with a type of Euclidean division. As a consequence, a fast algorithm based on a dichotomic process and FFT is designed. We prove also that these symmetric sub-resultants have a deep link with Toeplitz matrices. Finally, we propose a new algorithm of inversion for such matrices. It has the same cost as those already known, however it is fraction-free and consequently well adapted to computer algebra.

Affiliated with

Also associated with

No associations

Rating

Symmetric Subresultants and Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symmetric Subresultants and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric Subresultants and Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-531048