THE APPLICATION OF TRIDIAGONAL MATRIX ALGORITHM IN CUBIC SPLINE INTERPOLATION
DOI:
https://doi.org/10.22216/jit.v14i3.95Keywords:
Tridiagonal matrix algorithm, cubic spline interpolationAbstract
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
Downloads
Published
Issue
Section
License
Copyright (c) 2022 Lembaga Layanan Pendidikan Tinggi Wilayah X
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with Jurnal Ipteks Terapan ( Research of Applied Science and Education ) agree to the following terms:
- Authors retain copyright and grant Lembaga Layanan Pendidikan Tinggi Wilayah X right of first publication with the work simultaneously licensed under a Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in Jurnal Ipteks Terapan ( Research of Applied Science and Education ).
-
The author holds the copyright of the submitted and published articles, with the understanding that articles are disseminated under the Creative Commons Attribution 4.0 International License.
- The editor team is entitled to do the editing in accordance with the guidelines writing or templete in the Jurnal Ipteks Terapan ( Research of Applied Science and Education ).
