 | Select the desired Level or Schedule Type to find available classes for the course. |
| 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. Restrictions: May not be enrolled as the following Classifications: Sophomore: 45 - 59 hours Sophomore: 30 - 44 hours Freshman: 0 - 14 hours Freshman: 15 - 29 hours Prerequisites: GR-CS 51501 Requisites General Requirements: ( Student Attribute: GR May not be taken concurrently. ) or ( Rule: 1.: CS 50100 or 51500 ) CS 50100 Minimum Grade of D- May not be taken concurrently. CS 51500 Minimum Grade of D- May not be taken concurrently. End of rule 1. and Rule: 2.: CS 52500 CS 52500 Minimum Grade of D- May not be taken concurrently. End of rule 2. Short Title: Parallelism Numer Linear Alg Course Configurations:
|
|||||||||
 |