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 finite difference method, when used as a preconditioner for the minimal residual method, is found to be competitive with other methods based on factorization ideas and to be more robust.
TL;DR: In this paper, the Schrodinger equation with the Hulthen potential is studied by working in a complete square integrable basis that carries a tridiagonal matrix representation of the wave operator.
Abstract: The Schrodinger equation with the Hulthen potential is studied by working in a complete square integrable basis that carries a tridiagonal matrix representation of the wave operator. The arbitrary l-wave solutions are obtained by using an approximation of the centrifugal term. The resulting three-term recursion relation for the expansion coefficients of the wavefunction is presented and the wavefunctions are expressed in terms of the Jacobi polynomial. The discrete spectrum of the bound states is obtained by the diagonalization of the recursion relation.
TL;DR: In this paper, a numerical method for solving the optical Bloch equations in the center-of-mass momentum space for a closed V system in a counter-propagating field configuration was developed.
TL;DR: In this article , a fast algorithm was proposed to find the upper and lower bounds of the interval eigenvalues of a class of symmetric tridiagonal interval matrices with respect to a property of eigenvalue bounds.
Abstract: The eigenvalue bounds of interval matrices are often required in some mechanical and engineering fields. In this paper, we improve the theoretical results presented in a previous paper “A property of eigenvalue bounds for a class of symmetric tridiagonal interval matrices” and provide a fast algorithm to find the upper and lower bounds of the interval eigenvalues of a class of symmetric tridiagonal interval matrices.