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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oguzhan-baser%2FPolynomialSolver_IntervalBisection_vs_SecantMethod
PURL: pkg:github/oguzhan-baser/PolynomialSolver_IntervalBisection_vs_SecantMethod
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language: C++
Size: 243 KB
Dependencies parsed at: Pending
Created at: over 4 years ago
Updated at: over 3 years ago
Pushed at: over 4 years ago
Last synced at: about 2 years ago
Topics: interval-bisection, mathematics, numerical-methods, polynomial-solvers, root-finding, secant-method