About: Tridiagonal matrix algorithm is a research topic. Over the lifetime, 1070 publications have been published within this topic receiving 21084 citations.
TL;DR: In this paper, a fitting factor in Numerov fourth-order tridiagonal finite difference scheme is presented for singularly perturbed two-point boundary value problems with the boundary layer at both end (left and right) points.
Abstract: In this paper a fitted fourth-order finite difference scheme is presented for solving singularly perturbed two-point boundary value problems with the boundary layer at both end (left and right) points. We have introduced a fitting factor in Numerov fourth-order tridiagonal finite difference scheme and is obtained from the theory of singular perturbations. Thomas algorithm is used to solve the tridiagonal system. Several numerical examples are solved and compared with exact solution. It is observed that the present method approximates the exact solution very well.
TL;DR: In this article, an inertia theorem for tridiagonal matrices is proved and used to deduce a criterion of Wall which relates root location of polynomials to continued fractions.
TL;DR: A simple algorithm for solving a cyclic block-tridiagonal system of equations is presented, which can be solved by known methods and numerical examples of diagonal and random generated systems are presented.
TL;DR: A parallel algorithm for an MIMD computer that runs in time n 2 − 1 and needs 0.3536 … n processors in order to perform a Gaussian elimination with partial pivoting on an n × n matrix is presented.
TL;DR: In this article, the authors presented an m processor scalable communication-less approximation algorithm for solving a diagonally dominant tridiagonal Toeplitz system of linear equations and adapted the works of Rojo and McNally et al. to the non-symmetric case.