Solutions to Nonlinear Equations: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Solutions to Nonlinear Equations (Solutions to Nonlinear Equations)}} == Description == Compute the solutions to a given nonlinear equation of the form $f(x) = 0$. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Bisection method (Solutions to Nonlinear Equations Solutions to N...")
 
No edit summary
Line 26: Line 26:
|}
|}


== Time Complexity graph ==  
== Time Complexity Graph ==  


[[File:Solutions to Nonlinear Equations - Time.png|1000px]]
[[File:Solutions to Nonlinear Equations - Time.png|1000px]]


== Space Complexity graph ==  
== Space Complexity Graph ==  


[[File:Solutions to Nonlinear Equations - Space.png|1000px]]
[[File:Solutions to Nonlinear Equations - Space.png|1000px]]


== Pareto Decades graph ==  
== Pareto Frontier Improvements Graph ==  


[[File:Solutions to Nonlinear Equations - Pareto Frontier.png|1000px]]
[[File:Solutions to Nonlinear Equations - Pareto Frontier.png|1000px]]

Revision as of 14:05, 15 February 2023

Description

Compute the solutions to a given nonlinear equation of the form $f(x) = 0$.

Parameters

No parameters found.

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

Space Complexity Graph

Solutions to Nonlinear Equations - Space.png

Pareto Frontier Improvements Graph

Solutions to Nonlinear Equations - Pareto Frontier.png