This is the C++ code that I wrote in undergraduate Numerical Analysis - Fall 2016

C++ template project provides a flexible way to work with polynomials and calculate their real roots.

Several methods for root finding of polynomials (both real and complex roots)

Describe iterated map

Some common methods to find roots of non-linear equations are discussed. Interval Bisection and Secant Method are implemented and compared with each other.

A C++ header-only library of numerical methods for linear algebra, root-finding, intepolation and ODE solving.

🫚 Parallel Bairstow's Rootfinding Algorithm C++ Code

truncated taylor series class with VBIC95 example

Numerical Methods for the Root Finding Problem

Root finding & curve fitting methods implementation using object oriented c++

The Interpolate, Truncate, Project (ITP) Root-Finding Algorithm

Reference implementation for "Temporal Set Inversion for Animated Implicits" (SIGGRAPH 2023)

library of numerical methods using Armadillo

Root-Finder is a header-only univariate polynomial solver, which finds/counts all real roots of any polynomial within any interval.

Qt application to visualize newton fractals

Root-Finder is a header-only univariate polynomial solver, which finds/counts all real roots of any polynomial within any interval.

A modern c++ root finding algorithm based on the original Jenkins-Traub RPOLY software.