Parallel Computing and Scientific Machine Learning
Introduction to scientific machine learning with an emphasis on developing scalable differentiable programs. Covers scientific computing topics (numerical differential equations, dense and sparse linear algebra, Fourier transformations, parallelization of large-scale scientific simulation) simultaneously with modern data science (machine learning, deep neural networks, automatic differentiation), focusing on the emerging techniques at the connection between these areas, such as neural differential equations and physics-informed deep learning. Provides direct experience with the modern realities of optimizing code performance for supercomputers, GPUs, and multicores in a high-level language.
Fall 2011 · Parallel Computing
Topics
- Introduction
- Types of parallel computers
- Parallel prefix
- More parallel prefix
- Lincoln Labs view of the cloud; Intro to MapReduce
- MapReduce, as accumArray
- MapReduce, graph partitioning
- MapReduce, more partitioning
- Project discussion session
- Guest lecture by Dr. Viral B. Shah
- Parallel linear algebra past and future
- LU decomposition
- Ring and hypercube topologies
- Fast Fourier Transform (FFT)
- FFT (cont.)
- Parallel programming in Julia
- Domain decomposition, PDEs
- Finite differences, direct and iterative methods, preconditioned conjugate gradient
- Schur complement method; Intro to sparse methods
- Fast multipole method
- Guest lecture by Dr. Toby Bloom, Director, Informatics, Genome Sequencing, Broad Institute
- Student project presentations
- Student project presentations (cont.)
Readings
Prerequisites & course information
Same subject as 6.7320J Prereq: 18.06 , 18.700 , or 18.701 Acad Year 2027-2028: Not offered Acad Year 2028-2029: G (Spring) 3-0-9 units
Sources
- Course catalogue ↗2026–2027
- MIT OpenCourseWare ↗Fall 2011
- MIT OCW calendar ↗
- MIT OCW syllabus ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.