1975
DOI: 10.1145/355637.355643
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm 493: Zeros of a Real Polynomial [C2]

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

1990
1990
2016
2016

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 65 publications
(22 citation statements)
references
References 2 publications
0
22
0
Order By: Relevance
“…Instead, ellc uses the rpoly algorithm (Jenkins 1975) followed by "root-polishing" using Laguerre's algorithm (Press et al 1992) to ensure that the correct number of real roots is found and to ensure that they are accurate to within the machine floating-point precision. Given the roots of the quartics in x and y, the remaining task is to identify which combinations of these roots correspond to intersections of the ellipses.…”
Section: Appendix A: the Intersections Of Two Ellipsesmentioning
confidence: 99%
“…Instead, ellc uses the rpoly algorithm (Jenkins 1975) followed by "root-polishing" using Laguerre's algorithm (Press et al 1992) to ensure that the correct number of real roots is found and to ensure that they are accurate to within the machine floating-point precision. Given the roots of the quartics in x and y, the remaining task is to identify which combinations of these roots correspond to intersections of the ellipses.…”
Section: Appendix A: the Intersections Of Two Ellipsesmentioning
confidence: 99%
“…With relative coefficient magnitudes often spanning more than the 16 digits of precision available in a double, we observed catastrophic loss of precision in the eigensolver. Instead we used Bond's implementation of the well-known Jenkins-Traub root finding method [4] from http://www.crbond.com/download/misc/rpoly.cpp. In addition to complexity of implementation, the need for a sophisticated root finding technique in hs are two arguments in favor of our much simpler method.…”
Section: Synthetic Datamentioning
confidence: 99%
“…Since we now allow for arbitrary jet masses, the general solution for the leptonic b jet momentum requires solving a 8th-order polynomial, which we solve using the Jenkins-Traub algorithm [47]. Because more than one solution may be possible, we compute the integrand for up to four different solutions and sum the likelihood over these different solutions.…”
Section: Integration Variablesmentioning
confidence: 99%