Solutions to Nonlinear Equations: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 33: Line 33:


[[File:Solutions to Nonlinear Equations - Time.png|1000px]]
[[File:Solutions to Nonlinear Equations - Time.png|1000px]]
== Space Complexity Graph ==
[[File:Solutions to Nonlinear Equations - Space.png|1000px]]
== Time-Space Tradeoff ==
[[File:Solutions to Nonlinear Equations - Pareto Frontier.png|1000px]]

Latest revision as of 09:12, 28 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

Solutions to Nonlinear Equations - Time.png