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 two-directional unconditionally stable single field (US-SF) finite-difference time-domain (FDTD) method is generalized to a 3D vector wave equation.
Abstract: The recently developed two-directional unconditionally stable single-field (US-SF) finite-difference time-domain (FDTD) method is generalized to a 3-D. The method is based on the application of the Crank–Nicolson scheme to only one of Maxwell curl equations which leads to an unconditionally stable finite-difference solution of the 3-D vector wave equation in the time domain. The method is designated as a single field because only the electric (or magnetic) field is updated in each time step. The implicit equations for each time step can be solved using a tridiagonal matrix algorithm without a need for matrix inversion. To achieve this, we introduced a new modified time-splitting scheme for the multilevel difference equations. Unlike the existing time-splitting method used to solve such equations which results in instability when dealing with inhomogeneous media, the presented method remains stable. As an important feature of the proposed US-SF-FDTD method, the updating of the three field components can be executed simultaneously (in parallel) by applying multithreading, thereby significantly reducing runtime. The unconditional stability of the proposed method is proved analytically. The accuracy and computational efficiency of the proposed method are demonstrated by providing numerical examples and by comparison to other FDTD methods and to the analytic solution when available.
TL;DR: In this paper, the approximate analytical solution of the Dirac-Eckart problem with a Hulthen tensor interaction is investigated by working in a complete square integrable basis that supports a tridiagonal matrix representation of the wave operator.
TL;DR: In this paper, the authors established a strong componentwise perturbation bound for the solution of a diagonally dominant tridiagonal linear system, independent of the traditional condition number of the coefficient matrix.
Abstract: In this paper, we settle Higham’s conjecture for the LU factorization of diagonally dominant tridiagonal matrices. We establish a strong componentwise perturbation bound for the solution of a diagonally dominant tridiagonal linear system, independent of the traditional condition number of the coefficient matrix. We then accurately and efficiently solve the linear system by the GTH-like algorithm without pivoting, as suggested by the perturbation result.
TL;DR: A new divide and conquer parallel algorithm which is fast and numerically stable, work efficient and of low communication overhead, and it can be used to solve very large problems infeasible by sequential methods.
TL;DR: A parallel algorithm for transforming an n × n symmetric matrix to tridiagonal form is described, which could be the first step in the parallel solution of the symmetric eigenvalue problem in time O.