Root Computation with continuous first derivative (Root Computation)

From Algorithm Wiki
Revision as of 07:52, 10 April 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Root Computation with continuous first derivative (Root Computation)}} == Description == Given a real function with continuous first derivative, compute one of the roots. == Related Problems == Related: General Root Computation == Parameters == $\epsilon$: (additive) tolerance error $a, b$: endpoint values, with $b>a$ $n_{max}$: maximum number of iterations == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;"...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

Given a real function with continuous first derivative, compute one of the roots.

Related Problems

Related: General Root Computation

Parameters

$\epsilon$: (additive) tolerance error

$a, b$: endpoint values, with $b>a$

$n_{max}$: maximum number of iterations

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Newton's method 1940 $O(n_{max})$ $O({1})$ epsilon, additive Deterministic