Polynomial root bisection
Find a polynomial root in a sign-changing interval and inspect its residual, error bound and bounded iteration trace.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
m=(a+b)/2; retain a sign-changing interval
After 20 reductions of the 0–2 interval for x²−2, the root is about 1.41421413 with error bound about 0.000000954. The trace starts at left 0, midpoint 1, right 2, residual −1.
Supports 1–12 coefficients and 1–60 iterations; endpoints must bracket a sign change, not all roots are found. The trace shows the interval before updating and its midpoint value, with at most 60 rows; endpoint roots need no iterations.
Frequently asked questions
Why can root bisection reject an interval containing a root?
A sign change at the endpoints is required. Even-multiplicity roots without a sign change are not automatically detected.
Are a root residual and error bound the same?
No. Residual is the polynomial value; the error bound is half the remaining interval width.
When is each bisection trace interval recorded?
Each row records the interval before reduction and the midpoint residual. The final bound uses the interval after the last update.
Calculation criteria and reference materials
- NIST DLMF: Nonlinear Equations
m=(a+b)/2; retain a sign-changing interval
Verification of calculation criteria: · Calculation·verification principles · Report errors