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, 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: This paper first analyzes the potential parallel process of solving tridiagonal sparse linear equations by Gaussian elimination method and matrix splitting method, and designs and implements these two parallel algorithms to solve sparselinear equations.
Abstract: There are many practical problems in real life, which are finally attributed to solving large sparse linear equations. In order to solve sparse linear equations in parallel, this paper first analyzes the potential parallel process of solving tridiagonal sparse linear equations by Gaussian elimination method and matrix splitting method, and designs and implements these two parallel algorithms to solve sparse linear equations, Through different process tests and performance analysis, it shows that the Gaussian elimination method has poor time performance, while the matrix splitting method has good efficiency in both space and time.
TL;DR: The stride of three method for the solution of a tridiagonal system of equations for P processors is investigated and is organised in such a way that all processors are fully operational at every stage of the solution process.
Abstract: In this paper, the parallelisation of the stride of three method for the solution of a tridiagonal system of equations for P processors is investigated. The presented algorithm is organised in such a way that all processors are fully operational at every stage of the solution process. The results of experiments carried out on the Sequent Balance 8000 multiprocessor are presented.
TL;DR: This paper discusses the convergence of the double-shift and multi-shift QR algorithms for symmetric tridiagonal matrices and analyzes how to choose multi-shifts by comparing the relationships between the number of iterations, CPU time and thenumber of multi-Shifts.
TL;DR: An algorithm for the parallel solution of tridiagonal and pentadiagonal linear systems having nonzero elements at the top right and bottom left corners with high accuracy compact approximation to the first derivative.
Abstract: : An algorithm for the parallel solution of tridiagonal and pentadiagonal linear systems having nonzero elements at the top right and bottom left corners. Tridiagonal systems of this kind arise from the solution of two point boundary value problems with periodic boundary conditions. Penta- diagonal systems of this kind arise from e.g the approximation of the shallow water equations by the two-stage Galerkin method combined with a high accuracy compact approximation to the first derivative (Navon, 1983).