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 article, a tridiagonal determinant was found for the Fibonacci polynomials and, consequently, for the numbers in terms of a tridimensional determinant.
Abstract: In the paper, the authors find a new closed expression for the Fibonacci polynomials and, consequently, for the Fibonacci numbers, in terms of a tridiagonal determinant.
TL;DR: In this paper, the potential flow on a blade-to-blade surface of a turbomachine was analyzed using the Thomas algorithm and the numerical properties of resulting non-linear simultaneous equations were studied with respect to grid aspect ratios and convergence.
Abstract: The compressible potential flow on a blade-to-blade surface of a turbomachine is analysed using the Thomas algorithm. The numerical properties of resulting non-linear simultaneous equations are studied with respect to grid aspect ratios and convergence. The heuristic approach has established which are the important factors that affect the flow solution in typical blade-to-blade configurations.
TL;DR: In this article, a technique described by Peluso et al. is used to obtain better bounds for the diagonal elements of the inverse of diagonally dominant tridiagonal matrices.
Abstract: In this note we show how to improve some recent upper and lower bounds for the elements of the inverse of diagonally dominant tridiagonal matrices. In particular, a technique described by (R. Peluso, and T. Politi, Some improvements on two-sided bounds on the inverse of diagonally dominant tridiagonal matrices, Lin. Alg. Appl. Vol. 330 (2001) 1-14), is used to obtain better bounds for the diagonal elements.
TL;DR: Investigation of stability properties of time-point relaxation Runge-Kutta methods with respect to the tridiagonal systems of ordinary differential equations with two real parameters finds stability regions for these methods compared with the corresponding regions of the underlying Runge and Kutta methods.