From a Decimal Base to another Base (Loop-Break)
From a Decimal Base to another Base (While-Loop)
From a Decimal Base to another Base (Subroutine)
From a Decimal Base to another Base (Subroutine-Mod)
First code to obtain Euler Constant
Second code to obtain Euler Constant
Third code to obtain Euler Constant
Fourth code to obtain Euler Constant
Fifth code to obtain Euler Constant
Burden Problem to obtain Euler Constant
Burden Problem(2) to obtain Euler Constant
Bisection Method
Fixed-Point Iteration
Newton's Method
Secant's Method
Aitkens's Method
First version (use an original sequence). Principal Program.
Second version (it generates its own original sequence). Principal Program.
Steffensen’s Method
Muller's Method
Lagrange Polynomials versus Taylor Polynomials
Neville's Method
Auxiliary Program 1 (Data set of points)
Auxiliary Program 2 (Data set from function)
Newton's Interpolatory Divided Differences Method
Hermite Interpolation Method
Spline Interpolation Method
Tridiagonal systems subroutine
Spline construction and evaluation
Bezier Curves
Data set of points for Bezier Algorithm
Discrete Least Squares Approximation
Fitting Data with Quadratic and Cubic Polynomials)
Orthogonal Polynomials and Least Squares Approximation
Simpson Integration Formula Error
Pivot Strategies