Implementation of fixed point iteration method
-
Updated
May 4, 2018 - Java
Implementation of fixed point iteration method
A repository containing implementations of various numerical methods written in Python
If you find any errors in the work of algorithms, you can fix them by creating a pull request
Utilizing root-finding methods such as Bisection Method, Fixed-Point Method, Secant Method, and Newton's Method to solve for the roots of functions
A collection of Python programs that helps in Numerical Analysis.
Implementation of Numerical Computing Method For Semester Course Work
NUMERICAL METHODS solutions
🔢 Laboratory #1 for Number Methods
Numerical analysis methods implemented in Python.
Implementation of well-known numerical methods.
Hybrid Approach to Sparse Group Fused Lasso
Solving linear system with the fixed point iteration method, written in MPI C++
Codes in this repository are aimed to implement the prediction & simulation of the mathematical model in the paper [https://doi.org/10.1016/j.trb.2021.10.005] on a grid network and try to divide ODs into several clusters to accelerate the process.
Code of some numerical analysis methods with python.
Fixed-point iteration for finding the fixed point of a univariate, scalar-valued function.
Algorithms for root finding writting in c with, bash shell script that compiles and runs all executable files.
Numerical Analysis code from the Oscar Veliz YouTube Channel
Implementations of various Algorithms used in Numerical Analysis, from root-finding up to gradient descent and numerically solving PDEs.
WPF app for finding and visualizing the root values of non-linear math functions
Add a description, image, and links to the fixed-point-iteration topic page so that developers can more easily learn about it.
To associate your repository with the fixed-point-iteration topic, visit your repo's landing page and select "manage topics."