WestminsterResearch will not be accepting deposits until 9th March 2015. This is to allow for a system upgrade and server migration.

Fast triangularization of a symmetric tridiagonal matrix

Evans, David J. and Megson, Graham M. (1989) Fast triangularization of a symmetric tridiagonal matrix. Journal of Parallel and Distributed Computing, 6 (3). pp. 663-678. ISSN 0743-7315

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/0743-7315(89)90012-9


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 block structuring of data produces an almost eliminated form in time n + k2. The implicit result can be fully eliminated by only a constant number of extra operations independent of the matrix order (n), where k, and k2 are constants.

Item Type:Article
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:5784
Deposited On:03 Feb 2009 10:40
Last Modified:19 Oct 2009 15:40

Repository Staff Only: item control page