Comparisons of Two Algorithms for Matrix Multiplicaton

Personal Info

Member NamesEMAIL ADDRESS
Mark Chapmanmchapman@orca.st.usm.edu
Sungjun Parkspark@orca.st.usm.edu
Deborah DentDeborah.Dent@usm.edu




ABSTRACT

The reults of two implementations of matrix multiplication algorithms (special sparse matrix multiplication and Strassens) will be compared and discussed. In addition to the algorithm implementations, other variables that will be taken into consideration will be implemetation languages (FORTRAN, and C++), and floating point precision. We will discuss performance issues and show advantages and disadvantages of each implementation.


Last Update: 09/09/97
Web Author: Mark Chapman
This project is for Dr P@ marcin.paprzycki@ibspan.waw.pl or@ Home Page