About: Tridiagonal matrix algorithm is a research topic. Over the lifetime, 1070 publications have been published within this topic receiving 21084 citations.
TL;DR: The paper addresses the problem of computational efficiency of the pipe-flow model used in leak detection and identification systems with certain rearrangements, and reduces the model to a set of equations with tridiagonal matrices using the Thomas algorithm.
Abstract: The paper addresses the problem of computational efficiency of the pipe-flow model used in leak detection and identification systems. Analysis of the model brings attention to its specific structure, where all matrices are sparse. With certain rearrangements, the model can be reduced to a set of equations with tridiagonal matrices. Such equations can be solved using the Thomas algorithm. This method provides almost the same values of the state vector and maintains stability for the same discretization grid, while the computational overhead is vastly reduced.
TL;DR: Gaussian elimination is extended to split unitary groups and these algorithms have an application in building a public-key cryptosystem, and it is demonstrated that.
Abstract: Gaussian elimination is used in special linear groups to solve the word problem. In this paper, we extend Gaussian elimination to split unitary groups. These algorithms have an application in building a public-key cryptosystem, we demonstrate that.
TL;DR: In this article, a numerical integration method on a uniform mesh is presented for the solution of singularly perturbed two-point boundary value problems having boundary layer at one end (left or right) point.
Abstract: In this paper, a new numerical integration method on a uniform mesh is presented for the solution of
singularly perturbed two-point boundary value problems having boundary layer at one end (left or right) point. The
methods of Exact and Trapezoidal rule of integration with finite difference approximation of first derivatives are
used to obtain a three-term recurrence relationship . The obtained tridiagonal system of equations is then solved
using Thomas algorithm. Also, the stability and convergence of the proposed scheme are established. Several
model example problems are solved using the proposed method. The results are presented in terms of maximum
absolute errors which demonstrate the accuracy and efficiency of the method. It is observed that the proposed
method is capable of producing highly accurate results with minimal computational effort for a fixed value of step
size h, when perturbation parameter tends to zero.
TL;DR: In this paper, a fitted fourth order numerical scheme for singularly perturbed convection-diffusion equations is presented and the obtained scheme is transformed into a three-term recurrence relation and solved by Thomas algorithm.
Abstract: This paper presents a fitted fourth order numerical scheme for solving singularly perturbedconvection-diffusion equations. The obtained scheme is transformed into a three-term recurrence relation and solved by Thomas algorithm. The stability and convergence of thepresent method have been investigated. The numerical results are presented by tables and graphs. The present method helps us to get good results and also to know the behavior ofthe solution in the boundary layer for perturbation parameter e is less than mesh size h.Moreover, the present method improves the findings of some existing numerical methods reported in the literature.
TL;DR: In this article, a hybrid multigrid-Thomas algorithm is proposed to solve Poisson's equation as part of the spatial discretization of a time evolving PDE system.