A bounded bisection solver with bracket controls
Provide a small bisection implementation, a valid cubic-root example, an invalid-bracket control, and a high-precision Newton comparison.
Proposed original example. Source release and any execution are separate steps.
Does the solver preserve a shrinking root bracket and reject the specified invalid input?
Inspect endpoint signs and final width; compare with a separate Decimal Newton formulation for the fixed polynomial.
What you could produce
- A scoped observations JSON record and a comparison with the stated reference.
Before you use it
- Python 3.13 standard library
Limits to keep in view
- No research code was executed by the preparation tool.
- Author output cannot issue an independent scientific-verification result.
Source and permission context
Original local preparation by the Executable Science seed collection; upstream API references remain separately attributed.
Rights need review. Review the scope and upstream conditions before reuse.
Still unresolved
- Proposed local-draft licenses: original code MIT, explanations CC-BY-4.0, synthetic numeric data CC0-1.0; publication/disclosure approval remains separate.