# Root-finding algorithms

# Sqrt(x^2 + y^2) and atan(y x) via cordic in matlab

# Finds the root(s) of a function of one variable, including complex roots, using newton's method. in matlab

# Newton raphson method for transcendental equations in matlab

# Mullers method for polynmial root finding. in matlab

# This function quickly preforms newton's method on a vector function of multiple variables. in matlab

# Newton's method done right in matlab

# Newton raphson method gui in matlab

# Find the root of an equation using newton's method in matlab

# Newton's method animation in matlab

# Newton raphson method to find roots of a polynomial in matlab

# Regula Falsi Method Matlab Code

# Regula falsi method (numerical analysis) in matlab

# Regula falsi method in matlab

# Find root of a single variable function in matlab

# Secant Method Matlab Code

Secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite difference approximation of Newton's method. However, the method was developed independently of Newton's method, and predated the latter by over 3,000 years.

# Secant iteration in matlab

# Secant method in nonlinear ode in matlab

# Secant iteration method in matlab

# Secant method in matlab

# Secant method in matlab

# Bisection Method Matlab Code

The bisection method in mathematics is a root-finding method that repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods.The method is also called the interval halving method, the binary search method,or the dichotomy method.