Masters Theses

Date of Award

5-1993

Degree Type

Thesis

Degree Name

Master of Science

Major

Computer Science

Major Professor

Michael W. Berry

Committee Members

Jack Dongarra, Jean Blair

Abstract

In this thesis, we present both sequential and data-parallel implementations of the single-vector Lanczos algorithm for computing the singular value decomposition of large unstructured sparse matrices. Our intent is to produce robust numerical software in C that is portable across a variety of high-performance workstations such as the IBM RS/6000, DEC 5000-200, Sun Sparcstation 2, and Apple Macintosh Ilfx. Furthermore, this software should be easily incorporated into larger application programs such as those from large-scale information retrieval applications which require the computation of singular values and singular vectors of sparse matrices. Using the MasPar Programming Language on the MasPar MP-1 computer system, we develop a systematic approach for redesigning our software for a data-parallel environment. We approximate several of the largest singular values and singular vectors of a test suite of sparse matrices using two different equivalent eigensystems and provide benchmark and performance comparisions for each machine considered.

Download
Files over 3MB may be slow to open. For best results, right-click and select "save as..."

Share

COinS