Rectangular integration is a numerical integration technique that approximates the integral of a function with a rectangle.

Newton's (Newton–Raphson) method is a root-finding algorithm which produces successively better approximations to the roots of a real-valued function.

Trapezoidal Rule is an integration rule that evaluates the area under the curves by dividing the total area into smaller trapezoids.

Fixed-point iteration is a method of computing fixed points of a function, which is used with Newton's method to find roots of a differentiable function.

The Bisection method is a root-finding method that applies to any continuous functions for which one knows two values with opposite signs.

The Lagrange interpolation formula is a way to find a polynomial which takes on certain values at arbitrary points.

Newton’s divided difference interpolation formula is a interpolation technique used when the interval difference is not same for all sequence of values.

The Secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.

The Regula–Falsi Method is a numerical method for estimating the roots of a polynomial f(x).

Newton's (Newton-Gregory) Backward Difference formula is a way of approximating a function with an nth degree polynomial passing through (n+1) equally spaced points.

Newton's (Newton-Gregory) Forward Difference formula is a way of approximating a function with an nth degree polynomial passing through (n+1) equally spaced points.

Stirling's Central Difference interpolation gives the average of the values obtained by Gauss forward and backward interpolation formulae.