Results 211 to 218 of about 23,326 (218)
Some of the next articles are maybe not open access.

Fast triangularization of a symmetric tridiagonal matrix

Journal of Parallel and Distributed Computing, 1989
A simple linear systolic array is presented for triangularizing a symmetric tridiagonal matrix by Gaussian Elimination using nearest neighbor pivoting. The array consists of three cells requiring an area bounded by four simple inner product cells. The design can compute the elimination in time 2n + k1 for the simple point case and using an implicit 2*2
David J. Evans, Graham M. Megson
openaire   +2 more sources

A system of equations with a tridiagonal coefficient matrix

Applied Mathematics and Computation, 2004
It is shown that an upper triangular matrix equivalent to a non-singular tridiagonal matrix is easily found.
openaire   +2 more sources

Bounds for entries of the inverse matrix of a tridiagonal matrix

Applied Mathematics and Computation, 2013
Inequalities for the moduli of entries of the inverse matrix of a tridiagonal matrix are obtained. These results are applicable to a relatively large family of matrices which occur in many branches of numerical analysis, applied mathematics, and engineering.
openaire   +2 more sources

Calculation of the Eigenvalues of a Tridiagonal Hermitian Matrix

Journal of Mathematical Physics, 1961
For real symmetric or Hermitian matrices with tridiagonal form, the secular equation may be written as a continued fraction equation f(λ)=0. f(λ) is a member of a recursively defined sequence R(n)(λ) of n continued fractions if the secular equation is of the nth order. The basis for a new method of computing the eigenvalues of such tridiagonal matrices
openaire   +2 more sources

Reduction of a General Matrix to Tridiagonal Form

SIAM Journal on Matrix Analysis and Applications, 1991
An algorithm for reducing a nonsymmetric matrix to tridiagonal form as a first step toward finding its eigenvalues is described. The algorithm uses a variation of threshold pivoting, where at each step, the pivot is chosen to minimize the maximum entry in the transformation matrix that reduces the next column and row of the matrix. Situations are given
openaire   +2 more sources

Computation of an eigenvector of a symmetric tridiagonal matrix

Siberian Mathematical Journal, 1986
V. I. Kostin   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy