Solutions to Nonlinear Equations: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 6: Line 6:
== Parameters ==  
== Parameters ==  


No parameters found.
$\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(n_max)$ || $O({1})$ || Exact || Deterministic ||   
| [[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(n_max)$ || $O({1})$ || Exact || Deterministic ||   
| [[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(n_max)$ || $O({1})$ || Exact || Deterministic ||   
| [[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(n_max)$ || $O({1})$ || Exact || Deterministic ||   
| [[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

Error creating thumbnail: Unable to save thumbnail to destination

Space Complexity Graph

Error creating thumbnail: Unable to save thumbnail to destination

Time-Space Tradeoff

Error creating thumbnail: Unable to save thumbnail to destination