An automatic generator for sparse resultant based solvers for minimal problems in computer vision.
-
Updated
Nov 26, 2020 - MATLAB
An automatic generator for sparse resultant based solvers for minimal problems in computer vision.
This repo contains implementations of several numerical methods in MATLAB.
Some common methods to find roots of non-linear equations are discussed. Interval Bisection and Secant Method are implemented and compared with each other.
Add a description, image, and links to the polynomial-solvers topic page so that developers can more easily learn about it.
To associate your repository with the polynomial-solvers topic, visit your repo's landing page and select "manage topics."