Solutions to Nonlinear Equations: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
$\epsilon$: (additive) tolerance error | |||
$a, b$: endpoint values, with $b>a$ | |||
$n_{max}$: maximum number of iterations$ | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 16: | Line 20: | ||
|- | |- | ||
| [[Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Bisection method]] || -150 || $O( | | [[Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Bisection method]] || -150 || $O(n_{max})$ || $O({1})$ || Exact || Deterministic || | ||
|- | |- | ||
| [[Regula Falsi method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Regula Falsi method]] || -200 || $O( | | [[Regula Falsi method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Regula Falsi method]] || -200 || $O(n_{max})$ || $O({1})$ || Exact || Deterministic || | ||
|- | |- | ||
| [[Secant method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Secant method]] || -1400 || $O( | | [[Secant method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Secant method]] || -1400 || $O(n_{max})$ || $O({1})$ || Exact || Deterministic || | ||
|- | |- | ||
| [[Newton's method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Newton's method]] || 1669 || $O( | | [[Newton's method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)|Newton's method]] || 1669 || $O(n_{max})$ || $O({1})$ || Exact || Deterministic || | ||
|- | |- | ||
|} | |} | ||
Revision as of 07:53, 10 April 2023
Description
Compute the solutions to a given nonlinear equation of the form $f(x) = 0$.
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 |
|---|---|---|---|---|---|---|
| Bisection method | -150 | $O(n_{max})$ | $O({1})$ | Exact | Deterministic | |
| Regula Falsi method | -200 | $O(n_{max})$ | $O({1})$ | Exact | Deterministic | |
| Secant method | -1400 | $O(n_{max})$ | $O({1})$ | Exact | Deterministic | |
| Newton's method | 1669 | $O(n_{max})$ | $O({1})$ | Exact | Deterministic |
Time Complexity Graph
Space Complexity Graph
Time-Space Tradeoff
