Go to Main Content

Purdue Self-Service



Catalog Entries


Fall 2009
Apr 15, 2024
Transparent Image
Information Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. The Schedule Type links will be available only when the schedule of classes is available for the selected term.

CS 51501 - Parallelism In Numerical Linear Algebra
Credit Hours: 3.00. 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 a variety of computational science and engineering areas. Typically offered Fall Spring.
3.000 Credit hours

Syllabus Available
Levels: Undergraduate, Graduate, Professional
Schedule Types: Lecture

Offered By: College of Science
Department: Computer Science

Course Attributes:
Upper Division

May be offered at any of the following campuses:     
      West Lafayette

Learning Outcomes: The students will (a) become quite knowledgeable in handling these parallel numerical linear algebra algorithms that arise in computational science and engineering, (b) acquire problem-solving skills in this field, and (c) through written and oral presentations of their projects will be able to clearly communicate their solution strategies and the performance realized on parallel computing platforms.

Return to Previous New Search XML Extract
Transparent Image
Skip to top of page