GitHub / oguzhan-baser / PolynomialSolver_IntervalBisection_vs_SecantMethod
Some common methods to find roots of non-linear equations are discussed. Interval Bisection and Secant Method are implemented and compared with each other.
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language: C++
Size: 243 KB
Dependencies parsed at: Pending
Created at: about 4 years ago
Updated at: about 3 years ago
Pushed at: about 4 years ago
Last synced at: almost 2 years ago
Topics: interval-bisection, mathematics, numerical-methods, polynomial-solvers, root-finding, secant-method
Loading...