## CME 102: Ordinary Differential Equations for Engineers (ENGR 155A)

Analytical and numerical methods for solving ordinary differential equations arising in engineering applications are presented. For analytical methods students learn to solve linear and non-linear first order ODEs; linear second order ODEs; and Laplace transforms. Numerical methods using MATLAB programming tool kit are also introduced to solve various types of ODEs including: first and second order ODEs, higher order ODEs, systems of ODEs, initial and boundary value problems, finite differences, and multi-step methods. This also includes accuracy and linear stability analyses of various numerical algorithms which are essential tools for the modern engineer. This class is foundational for professional careers in engineering and as a preparation for more advanced classes at the undergraduate and graduate levels. Prerequisites:
Math 21 (preferred), or equivalent (5 on the AP Calculus BC test or suitable score on certain international exams:
https://studentservices.stanford.edu/my-academics/earn-my-degree/undergraduate-degree-progress/test-transfer-credit/external-test-2)

Terms: Aut, Win
| Units: 5
| UG Reqs: GER:DB-Math, WAY-FR

## CME 102ACE: Ordinary Differential Equations for Engineers, ACE

Students attend
CME102/ENGR155A lectures with additional recitation sessions; two to four hours per week, emphasizing engineering mathematical applications and collaboration methods. Enrollment by department permission only. Prerequisite: must be concurrently enrolled in
CME102. Application at:
https://engineering.stanford.edu/students/programs/engineering-diversity-programs/additional-calculus-engineers

Terms: Aut, Win
| Units: 1

Instructors:
Jose, A. (PI)
;
Vu, L. (PI)

## CME 106: Introduction to Probability and Statistics for Engineers (ENGR 155C)

Probability: random variables, independence, and conditional probability; discrete and continuous distributions, moments, distributions of several random variables. Numerical simulation using Monte Carlo techniques. Topics in mathematical statistics: random sampling, point estimation, confidence intervals, hypothesis testing, non-parametric tests, regression and correlation analyses. Numerous applications in engineering, manufacturing, reliability and quality assurance, medicine, biology, and other fields. Prerequisite:
CME100/ENGR154 or
Math 51 or 52.

Terms: Win
| Units: 4
| UG Reqs: GER:DB-Math, WAY-FR, WAY-AQR

Instructors:
Khayms, V. (PI)

## CME 106ACE: Introduction to Probability and Statistics for Engineers

Students attend
CME106/ENGR155C lectures with additional recitation sessions; two to four hours per week, emphasizing engineering mathematical applications and collaboration methods. Enrollment by department permission only. Prerequisite: must be concurrently enrolled in
CME106. Application at:
https://engineering.stanford.edu/students/programs/engineering-diversity-programs/additional-calculus-engineers

Terms: Win
| Units: 1

Instructors:
Chian, S. (PI)

## CME 187: Mathematical Population Biology (BIO 187, BIO 287)

Mathematical models in population biology, in biological areas including demography, ecology, epidemiology, evolution, and genetics. Mathematical approaches include techniques in areas such as combinatorics, differential equations, dynamical systems, linear algebra, probability, and stochastic processes. Math 50 or 60 series is required, and at least two of (
Bio 81,
Bio 82,
Bio 85) are strongly recommended.

Terms: Win
| Units: 3

Instructors:
Rosenberg, N. (PI)

## CME 192: Introduction to MATLAB

This short course runs for the first four weeks/eight lectures of the quarter and is offered each quarter during the academic year. It is highly recommended for students with no prior programming experience who are expected to use MATLAB in math, science, or engineering courses. It will consist of interactive lectures and application-based assignments. The goal of the short course is to make students fluent in MATLAB and to provide familiarity with its wide array of features. The course covers an introduction of basic programming concepts, data structures, and control/flow; and an introduction to scientific computing in MATLAB, scripts, functions, visualization, simulation, efficient algorithm implementation, toolboxes, and more.

Terms: Aut, Win, Spr
| Units: 1

Instructors:
Rebei, A. (PI)

## CME 193: Introduction to Scientific Python

It is recommended for students who are familiar with programming at least at the level of CS106A and want to translate their programming knowledge to Python with the goal of becoming proficient in the scientific computing and data science stack. Lectures will be interactive with a focus on real world applications of scientific computing. Technologies covered include Numpy, SciPy, Pandas, Scikit-learn, and others. Topics will be chosen from Linear Algebra, Optimization, Machine Learning, and Data Science. Prior knowledge of programming will be assumed, and some familiarity with Python is helpful, but not mandatory.

Terms: Aut, Win, Spr
| Units: 1

Instructors:
Nzia Yotchoum, H. (PI)

## CME 204: Partial Differential Equations in Engineering (ME 300B)

Geometric interpretation of partial differential equation (PDE) characteristics; solution of first order PDEs and classification of second-order PDEs; self-similarity; separation of variables as applied to parabolic, hyperbolic, and elliptic PDEs; special functions; eigenfunction expansions; the method of characteristics. If time permits, Fourier integrals and transforms, Laplace transforms. Prerequisite:
CME 200/
ME 300A, equivalent, or consent of instructor.

Terms: Win
| Units: 3

Instructors:
Lele, S. (PI)

## CME 216: Machine Learning for Computational Engineering. (ME 343)

Linear and kernel support vector machines, deep learning, deep neural networks, generative adversarial networks, physics-based machine learning, forward and reverse mode automatic differentiation, optimization algorithms for machine learning, TensorFlow, PyTorch.

Terms: Win
| Units: 3

Instructors:
Darve, E. (PI)

## CME 241: Foundations of Reinforcement Learning with Applications in Finance (MS&E 346)

This course is taught in 3 modules - (1) Markov Processes and Planning Algorithms, including Approximate Dynamic Programming (3 weeks), (2) Financial Trading problems cast as Stochastic Control, from the fields of Portfolio Management, Derivatives Pricing/Hedging, Order-Book Trading (2 weeks), and (3) Reinforcement Learning Algorithms, including Monte-Carlo, Temporal-Difference, Batch RL, Policy Gradient (4 weeks). The final week will cover practical aspects of RL in the industry, including an industry guest speaker. The course emphasizes the theory of RL, modeling the practical nuances of these finance problems, and strengthening the understanding through plenty of programming exercises. No pre-requisite coursework expected, but a foundation in undergraduate Probability, basic familiarity with Finance, and Python programming skills are required.

Terms: Win
| Units: 3

Instructors:
Rao, A. (PI)

Filter Results: