Creating an Model for Finding best Prediction

Project 1: Root Finding Methods

Implementation and usage of numerical root-finding algorithms.

Three body simulation in terminal.

Likelihood-ratio test for normally distributed populations with non-constant variance. Essentially a LRT equivalent to Welch's ANOVA. Documented in LaTeX, implemented in Python.

Métodos numéricos con python(Numpy, matplotlib, pandas)

Python program to approximate square roots using Newton's method

The Babylonian method for finding square roots by hand | Heron's method | Newton's method

Root-finding algorithms implementation. 2019

Numerical Algorithms course projects

Implementation of Logistic Regression and Finding optimal coefficient with Intercept using Newton's Method and Gradient Descent method.

implementation of Algorithms on Arrays

Algorithm Of Convex Optimizer

Programming assignments of Numerical Methods Sessional Course CSE 218 in Level-2, Term-1 of CSE, BUET

Simulate a multi-segment robotic arm.

Sample Convex Optimization using Gradient Descent, Newton's method and Coordinate Descent

The behaviour of general root-finding algorithms is studied in numerical analysis. How-ever, for polynomials, root-finding study belongs generally to computer algebra, sincealgebraic properties of polynomials are fundamental for the most efficient algorithms. The efficiency of an algorithm may depend dramatically on the characteristics of the gi…

🎓 My university course in numerical analysis from Fedor Sergeevich Peplin. Here you can find some implemented algorithms from this subject with a brief description.