TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
|
Files | |
babylonian_method.cpp | |
A babylonian method (BM) is an algorithm that computes the square root. | |
bisection_method.cpp | |
Solve the equation \(f(x)=0\) using bisection method | |
brent_method_extrema.cpp | |
Find real extrema of a univariate real function in a given interval using Brent's method. | |
composite_simpson_rule.cpp | |
Implementation of the Composite Simpson Rule for the approximation. | |
durand_kerner_roots.cpp | |
Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm | |
false_position.cpp | |
Solve the equation \(f(x)=0\) using false position method, also known as the Secant method. | |
fast_fourier_transform.cpp | |
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). | |
gaussian_elimination.cpp | |
Gaussian elimination method | |
golden_search_extrema.cpp | |
Find extrema of a univariate real function in a given interval using golden section search algorithm. | |
gram_schmidt.cpp | |
Gram Schmidt Orthogonalisation Process | |
inverse_fast_fourier_transform.cpp | |
An inverse fast Fourier transform (IFFT) is an algorithm that computes the inverse fourier transform. | |
lu_decompose.cpp | |
LU decomposition of a square matrix | |
lu_decomposition.h | |
Functions associated with LU Decomposition of a square matrix. | |
midpoint_integral_method.cpp | |
A numerical method for easy approximation of integrals | |
newton_raphson_method.cpp | |
Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions. | |
ode_forward_euler.cpp | |
Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method | |
ode_midpoint_euler.cpp | |
Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method | |
ode_semi_implicit_euler.cpp | |
Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method | |
qr_decompose.h | |
Library functions to compute QR decomposition of a given matrix. | |
qr_decomposition.cpp | |
Program to compute the QR decomposition of a given matrix. | |
qr_eigen_values.cpp | |
Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method. | |
rungekutta.cpp | |
Runge Kutta fourth order method implementation | |
successive_approximation.cpp | |
Method of successive approximations using fixed-point iteration method. | |