Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithm

Algorithm Amgorithms ALGORITHM 153 : R(f,r)(_1)def lead(f)deg f.def g c-deg g-deg r f D i s c r i m i n a n t of a Polynomial in One Variable over the Integers Jeffrey O. Shallit (6.622) This equation gives a method the resultant by a Euclidean This is done in the function for computing algorithm. RESUL. The d i s c r i m i n a n t of a polynomial P is a useful quantity in the theory of e q u a t i o n s (for example, see [I]). For a polynomial f(x)=axn+bxn-1+o.., it is u s u a l l y defined D=a2n-2 (ri_rj) 2 where rl, r2 ' ...~ rn as are the roots of f(x) and the product is taken over all possible pairs of roots. D is t h e r e f o r e a polynomial in the c o e f f i cients of f(x) with the property that D=O if f(x) has a repeated root. The d i s c r i m i nant is related to the r e s u l t a n t by the following formula (see http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGAPL APL Quote Quad Association for Computing Machinery

Algorithm

Thomson, Norman D.
ACM SIGAPL APL Quote Quad , Volume 12 (4) – Jun 1, 1982
Download PDF
2 pages

Loading next page...
 
/lp/association-for-computing-machinery/algorithm-rEybmVQxod

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1982 by ACM Inc.
ISSN
0163-6006
DOI
10.1145/586706.586711
Publisher site
See Article on Publisher Site

Abstract

Amgorithms ALGORITHM 153 : R(f,r)(_1)def lead(f)deg f.def g c-deg g-deg r f D i s c r i m i n a n t of a Polynomial in One Variable over the Integers Jeffrey O. Shallit (6.622) This equation gives a method the resultant by a Euclidean This is done in the function for computing algorithm. RESUL. The d i s c r i m i n a n t of a polynomial P is a useful quantity in the theory of e q u a t i o n s (for example, see [I]). For a polynomial f(x)=axn+bxn-1+o.., it is u s u a l l y defined D=a2n-2 (ri_rj) 2 where rl, r2 ' ...~ rn as are the roots of f(x) and the product is taken over all possible pairs of roots. D is t h e r e f o r e a polynomial in the c o e f f i cients of f(x) with the property that D=O if f(x) has a repeated root. The d i s c r i m i nant is related to the r e s u l t a n t by the following formula (see

Journal

ACM SIGAPL APL Quote Quad – Association for Computing Machinery

Published: Jun 1, 1982

There are no references for this article.