The project aims to implement and testing in different way different numerical calculus algorithms. Project developed during the Numerical Calculus course @ Department of Computer Science @ University of Bari "Aldo Moro" under the supervision of dr. Roberto Garrappa.
There are five different topics, for each of which we implement and test the main algorithms
- Epsilon Machine
- Conditioning of sum, product and function
- Approximation of the derivative
- Rotation matrix
- Laplace determinant
- Forward substitutions
- Backwards substitutions
- Gauss elimination
- Gauss elimination (pivoting)
- LU factorization
- LU factorization (pivoting)
- Iterative methods (Gauss Seidel, Jacobi)
- Indeterminate coefficients' method
- Lagrange First Formula
- Lagrange Second Formula
- Newton's method
- Convergence test
- Chebyshev nodes and Equidistance nodes
- Newton's method
- Secant's method
- Bisection's method
- Simple and composite trapezoid's method
- Simple and composite Simpson's method
- Convergence test
This project is released under the MIT License. See the LICENSE file for details.