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, the authors studied physical phenomena with critical blow-up regimes simulated by the 3D nonlinear diffusion equation in a spherical shell, where the original differential operator is split along the radial coordinate, as well as an original technique of using two coordinate maps for solving the 2D subproblem on the sphere is involved.
Abstract: Physical phenomena with critical blow-up regimes simulated by the 3D nonlinear diffusion equation in a spherical shell are studied. For solving the model numerically, the original differential operator is split along the radial coordinate, as well as an original technique of using two coordinate maps for solving the 2D subproblem on the sphere is involved. This results in 1D finite difference subproblems with simple periodic boundary conditions in the latitudinal and longitudinal directions that lead to unconditionally stable implicit second-order finite difference schemes. A band structure of the resulting matrices allows applying fast direct (non-iterative) linear solvers using the Sherman-Morrison formula and Thomas algorithm. The developed method is tested in several numerical experiments. Our tests demonstrate that the model allows simulating different regimes of blow-up in a 3D complex domain. In particular, heat localisation is shown to lead to the breakup of the medium into individual fragments followed by the formation and development of self-organising patterns, which may have promising applications in thermonuclear fusion, nonlinear inelastic deformation and fracture of loaded solids and media and other areas.
TL;DR: In this paper, a fast algorithm for inverting a tridiagonal matrix of n order was given, whose calculating quantity of arithmetic operation is only n 2+7n-8.
Abstract: In this paper, we give the fast algorithm for inverting a tridiagonal matrix of n order. Its calculating quantity of arithmetic operation is only n2+7n-8. At the same time, we give the expression on the elements of the inverse tridiagonal matrix, on which we get exact estimate. It greatly expands and improves the results of [2], [3].
TL;DR: In this paper, the upper bound for inverse elements of strictly diagonally dominant periodic tridiagonal matrices is given. But the upper bounds are not applicable to the case of strictly dominant periodic matrices.
Abstract: In this paper, we give the upper bounds for inverse elements of strictly diagonally dominant periodic tridiagonal matrices.
TL;DR: The natural parallelism of the algorithm makes it an excellent candidate for a variety of advanced architectures and it appears that the method is strongly competitive with other methods.
Abstract: In this paper, a fully parallel method for finding all eigenvalues of a real matrix pencil (A,B) is given, where A and B are real symmetric tridiagonal and B is positive definite. The method is based on the homotopy continuation coupled with the strategy ?Divide-Conquer? and Laguerre iterations. The numerical results obtained from implementation of this method on both single and multiprocessor computers are presented. It appears that our method is strongly competitive with other methods. The natural parallelism of our algorithm makes it an excellent candidate for a variety of advanced architectures.