Name
Abstract | ||
|---|---|---|
We present a new algorithm for refining a real interval containing a single real root: the new method combines the robustness of the classical Bisection algorithm with the speed of the Newton-Raphson method; that is, our method exhibits quadratic convergence when refining isolating intervals of simple roots of polynomials (and other well-behaved functions). We assume the use of arbitrary precision rational arithmetic. Unlike Newton-Raphson our method does not need to evaluate the derivative. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2644288.2644291 | ACM Comm. Computer Algebra |
Keywords | Field | DocType |
algorithms,design,numerical algorithms,numerical linear algebra,theory | Discrete mathematics,Combinatorics,Bisection method,Real roots,Polynomial,Arbitrary-precision arithmetic,Quadratic equation,Robustness (computer science),Root-finding algorithm,Rate of convergence,Mathematics | Journal |
Volume | Issue | ISSN |
48 | 1/2 | ACM Communications in Computer Algebra, vol. 48, no. 1, issue 187,
pp. 3--12 (2014) |
Citations | PageRank | References |
8 | 0.53 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Abbott | 1 | 10 | 4.56 |