THE APPLICATION OF TRIDIAGONAL MATRIX ALGORITHM IN CUBIC SPLINE INTERPOLATION

Abstract

Tridiagonal matrix algorithm is known to be more efficient in the computational process than the
Gaussian elimination method in solving linear system problems involving tridiagonal matrices. In
this paper, the tridiagonal matrix algorithm is applied to the cubic spline interpolation problem with
natural boundary conditions. In this case, the tridiagonal matrix algorithm plays a role in finding
the second derivative of each cubic spline sub-function so that it is more efficient in obtaining the
coefficients of the third order polynomials that form the cubic spline function