Keywords

Algorithms, Computer architecture, Matrix inversion

Abstract

Reducing the computing time of the matrix inversion has been a concern of many authors. The use of Systolic architectures containing orthogonally connected processing elements capable of few instructions multiple data have allowed for new algorithms to be implemented. Two algorithms are examined that rely on the triangularization methods for matrix inversion. One can be applied to the general non-singular matrix and the other to the symmetric matrix. The throughput in both implementation is revolutionized. The speed improvement over Liu and Young’s implementation of the symmetric matrix inversion is by a factor of three.

The throughput in both implementation is revolutionized. The speed improvement over Liu and Young’s implementation of the symmetric matrix inversion is by a factor of three.

Notes

If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu

Graduation Date

1987

Semester

Fall

Advisor

Papadourakis, George M.

Degree

Master of Science (M.S.)

College

College of Engineering

Department

Computer Engineering

Format

PDF

Pages

124 p.

Language

English

Rights

Public Domain

Length of Campus-only Access

None

Access Status

Masters Thesis (Open Access)

Identifier

DP0020532

Accessibility Status

Searchable text

Download

Share

COinS