Stanford Root

Schedule

Stanford Root

Schedule

CME 345

Projection-Based Model Order Reduction (AA 216)

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

Projection-based model order reduction (PMOR) is an important pillar of physics-based machine learning. It is critical for computational-based design and optimization, statistical analysis, embedded computing, and real-time optimal control; and indispensable for scenarios where real-time, physics-based numerical simulation responses are desired. This course presents the basic mathematical theory for PMOR. Topics include: Orthogonal and oblique projections; Galerkin and Petrov-Galerkin projections; error analysis; proper orthogonal decomposition and connection with singular value decomposition; linear dynamical systems; balanced truncation methods; moment matching methods; nonlinear dynamical systems; local parametric database approaches; nonlinear approximation methods and connection with deep learning; the least-Squares Petrov Galerkin method; and hyperreduction. Course material is complemented by a balanced set of theoretical, algorithmic, and computer programming assignments. Prerequisites: CME 200 or equivalent, CME 263 or equivalent, and basic numerical methods for ODEs.

Syllabus for selected term:
View Autumn 2026 Syllabus

Sections

1 Term
Lecture 1Open
ID: 6459
0 / 30 enrolled
DAYS:Monday, Wednesday, Friday
TIME:10:30 AM – 11:50 AM
LOCATION:McCullough 126
INSTRUCTOR:
Farhat, Charbel, Porrello, Christian
3units

CME 345: Projection-Based Model Order Reduction (AA 216)

3 units · Letter or Credit/No Credit

Projection-based model order reduction (PMOR) is an important pillar of physics-based machine learning. It is critical for computational-based design and optimization, statistical analysis, embedded computing, and real-time optimal control; and indispensable for scenarios where real-time, physics-based numerical simulation responses are desired. This course presents the basic mathematical theory for PMOR. Topics include: Orthogonal and oblique projections; Galerkin and Petrov-Galerkin projections; error analysis; proper orthogonal decomposition and connection with singular value decomposition; linear dynamical systems; balanced truncation methods; moment matching methods; nonlinear dynamical systems; local parametric database approaches; nonlinear approximation methods and connection with deep learning; the least-Squares Petrov Galerkin method; and hyperreduction. Course material is complemented by a balanced set of theoretical, algorithmic, and computer programming assignments. Prerequisites: CME 200 or equivalent, CME 263 or equivalent, and basic numerical methods for ODEs.

Offered in Autumn 2026 at Stanford University.

Autumn 2026 sections

  • Lecture — Monday Wednesday Friday 10:30 AM – 11:50 AM — McCullough 126 — Farhat, Charbel, Porrello, Christian (Graduate)

More CME courses

  • CME 306: Computational Methods of Applied Mathematics (MATH 220B)
  • CME 307: Optimization (MS&E 311)
  • CME 308: Stochastic Methods in Engineering (MATH 228, MS&E 324)
  • CME 309: Randomized Algorithms and Probabilistic Analysis (CS 265)
  • CME 310: Combinatorial Optimization (CS 261, MS&E 315)
  • CME 330: Applied Mathematics in the Chemical and Biological Sciences (CHEMENG 300)
  • CME 356: Engineering Functional Analysis and Finite Elements (ME 412)
  • CME 364A: Convex Optimization I (EE 364A)
  • CME 364B: Convex Optimization II (EE 364B)
  • CME 369: Computational Methods in Fluid Mechanics (ME 469)
  • CME 390: Curricular Practical Training
  • CME 391: Ph.D. Research Rotation

All CME courses · All departments