scientific article; zbMATH DE number 176431
[For the entire collection see Zbl 0753.00017.] Let \(a,b\in \mathbb{R}\), \(a<b\) and the function \(f:[a,b]\to\mathbb{R}\) have a simple zero \(x^*\). The author considers a combination of Newton's method and a certain ``tangential parabola method to generate a sequence of compact intervals \(J_ n:=[a_ n,b_ n] \subset [a,b]\) \((n\in\mathbb{N})\) which he shows to enclose \(x^*\) monotonically and \(d(J_{n+1}) \leq\text{const}\cdot[d(J_ n)]^ 2\), \([d(J_ n)\) being the length of the interval \(J_ n\)] under certain assumptions. The cost is one evaluation of \(f\) and one of its derivatives for each iteration step only. Three numerical examples.
- scientific article; zbMATH DE number 4062479 (Why is no real title available?)
- scientific article; zbMATH DE number 2099964 (Why is no real title available?)
- Combined bracketing methods for solving nonlinear equations
- An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035588)
