Brent Solver: Fast converging iterative root finding math solver based on modified Brent-Dekker algorithm. Finds root for well behaving equations in ~10 iterations.
-
Updated
May 26, 2024 - Java
Brent Solver: Fast converging iterative root finding math solver based on modified Brent-Dekker algorithm. Finds root for well behaving equations in ~10 iterations.
Numerical Methods in SciPy
Basic python module for beginners demonstrating different numerical techniques
A repository of numerical methods meant for educational purposes.
Aberth's method for finding the zeros of a polynomial
Examples and demos showing how to call functions from the NAG Library for Python
C++ template project provides a flexible way to work with polynomials and calculate their real roots.
Find functions' zeros using Bisection, Fixed Point, Newton, Secants Methods
🫚 Parallel Bairstow's Rootfinding Algorithm C++ Code
Solve symbolically defined systems of non-linear equations numerically.
Reverse engineering, getting root access to Tenda MW6 wifi mesh router
Provides custom pure-julia numerical methods for the differentiation, interpolation, minimisation and root finding of univariate and multivariate functions.
Computer Science and related topics are the main focus of this repository. Mainly, Python language is used here.
Collection of methods for numerical analysis and scientific computing, including numerical root-finders, numerical integration, linear algebra, and data visualization. Created for APPM4600 at CU Boulder.
collection of numerical optimization methods
Classification of John Burkardt's many Fortran 90 codes
Fatou sets in Julia (Fractals, Newton basins, Mandelbrot)
Add a description, image, and links to the root-finding topic page so that developers can more easily learn about it.
To associate your repository with the root-finding topic, visit your repo's landing page and select "manage topics."