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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
