This course examines both theoretical and practical aspects of numerical algorithm design and implementation on parallel computing platforms. In particular, it provides an understanding of the tradeoff between arithmetic complexity and management of hierarchical memory structures, roundoff characteristics if different from the sequential schemes, and performance evaluation and enhancement. Applications are derived from computational science and engineering. For more information, please see http://www.cs.purdue.edu/homes/wjg/syllabi/590S.059.doc

Homepage	http://www.cs.purdue.edu/homes/wjg/syllabi/590S.059.doc
Usually Offered:	Fall
Credit:	3 hours (class)
Prerequisite:	CS 525, and CS 514 or CS 515; or consent of instructor
University Catalog:	CS 590S
Schedule:	Fall 2005 Instructor: Ahmed Sameh