Solutions to Nonlinear Equations: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 34: Line 34:
[[File:Solutions to Nonlinear Equations - Space.png|1000px]]
[[File:Solutions to Nonlinear Equations - Space.png|1000px]]


== Pareto Frontier Improvements Graph ==  
== Time-Space Tradeoff ==  


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

Revision as of 14:48, 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

Time-Space Tradeoff

Solutions to Nonlinear Equations - Pareto Frontier.png