You're not currently signed in. Sign in »

CS 554 / CSE 512: Parallel Numerical Algorithms (Fall 2023)

What Where
Time Wed/Fri 11:00-12:15
Location 1302 Siebel
Instructor Edgar Solomonik (office: 4229 Siebel, email:
Instructor Office Hours Fridays 2:30-3:30pm (4229 Siebel)
TA Alexey Voronin (email:
TA Office Hours Tuesdays 2-3pm (virtual/zoom: see piazza for a link)
Class URL
Class recordings View MediaSpace »
Web forum View Piazza »

Brief Course Description

Numerical algorithms for parallel computers: parallel algorithms in numerical linear algebra (dense and sparse solvers for linear systems and the algebraic eigenvalue problem), numerical handling of ordinary and partial differential equations, and numerical optimization techniques.


Homework 1 (due September 6th) »

Homework 2 (due September 27th) »

Project Proposal (due Oct 11) »


Due a week after the start of each lecture, posted prior to lecture, covered in class.

Quiz 1: Parallel Architectures »

Quiz 2: Network Topologies and Collective Communication »

Quiz 3: Collective Communication and Parallel Algorithm Design »

Quiz 4: Parallel Algorithm Design »

Quiz 5: Parallel Programming Languages »

Quiz 6: Analysis of Parallel Algorithms »

Quiz 7: Efficiency and Scalability for Vector and Matrix Products »

Quiz 8: Parallel Matrix Multiplication and LU Factorization »

Quiz 9: LU Factorization and Triangular Solve »

Quiz 10: Triangular Solve and Sparse Matrix Products »

Course organization

Virtual and physical participation for all components the course will be made possible. Late enrollment/registration is also possible (immediate participation is welcome if registration is anticpated).

Grading: 30% project, 25% homework, 18% midterm (in class, Oct 20), 18% final (in class, Dec 6th), 9% quizzes may be subject to upwards curve

Projects: Submit initial proposal by Oct 11, revisions may be requested and will be due Oct 27. Students will have the option of preparing a final report or a poster presentation. Projects related to ongoing investigations or overlapping with other courses are encouraged, so long as they have some component related to this course.

Slides and notes are based on the Fall 2015 slides by Michael T. Heath. Resources relevant to the course are available also on the old course webpage by Prof. Heath. See also the previous course webpage.

Course Outline