Efficient Solution for Cubic Spline Interpolation using LU decomposition

摘要

#$%^&*AU2015100626A420150611.pdf#####ABSTRACT The cubic spline interpolation is often solved using tri-diagonal system of equations. This invention solves the cubic spline interpolation problem using LU decomposition. The linear system of equations resulting from applying the cubic spline interpolation constraints is converted into a matrix using a unique logic in order to achieve LU decomposition more effectively and using less computing power. Another optimizer algorithm is devised which rearranges the matrix rows in case the matrix has anomalies inhibiting it from getting decomposed.