CME 20Q:
Computational Modeling for Future Leaders
Preference to sophomores. How can we harness and exploit the power of computational modeling? What responsibilities are there in developing and using computer models? In this course we will analyze fundamental issues inherent to computational modeling such as uncertainty, predictability, error, and resolution. We will furthermore examine the social context of computational modeling including the public perception of computational models, how computer modeling impacts politics and policy, and how politics and policy, in turn, influence computer modeling.
Terms: Win
| Units: 3
CME 100:
Vector Calculus for Engineers (ENGR 154)
Computation and visualization using MATLAB. Differential vector calculus: analytic geometry in space, functions of several variables, partial derivatives, gradient, unconstrained maxima and minima, Lagrange multipliers. Introduction to linear algebra: matrix operations, systems of algebraic equations, methods of solution and applications. Integral vector calculus: multiple integrals in Cartesian, cylindrical, and spherical coordinates, line integrals, scalar potential, surface integrals, Green¿s, divergence, and Stokes¿ theorems. Examples and applications drawn from various engineering fields. Prerequisites: MATH 41 and 42, or 10 units AP credit. Note: Students enrolled in section 100-02 and 100A-02 are required to attend the discussion sections on Thursdays 5:15-6:45.
Terms: Aut, Spr
| Units: 5
| UG Reqs: GER:DB-Math, WAY-FR
CME 100A:
Vector Calculus for Engineers, ACE
Students attend CME100/ENGR154 lectures with additional recitation sessions; two to four hours per week, emphasizing engineering mathematical applications and collaboration methods. Enrollment by department permission only. Prerequisite: application at:http://soe.stanford.edu/current_students/edp/programs/ace.html
Terms: Aut, Spr
| Units: 6
| UG Reqs: GER:DB-Math, WAY-FR
CME 102:
Ordinary Differential Equations for Engineers (ENGR 155A)
Analytical and numerical methods for solving ordinary differential equations arising in engineering applications: Solution of initial and boundary value problems, series solutions, Laplace transforms, and nonlinear equations; numerical methods for solving ordinary differential equations, accuracy of numerical methods, linear stability theory, finite differences. Introduction to MATLAB programming as a basic tool kit for computations. Problems from various engineering fields. Prerequisite: CME 100/ENGR 154 or MATH 51.
Terms: Aut, Win, Spr, Sum
| Units: 5
| UG Reqs: GER:DB-Math, WAY-FR
CME 102A:
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. Prerequisite: application at:http://soe.stanford.edu/current_students/edp/programs/ace.html
Terms: Aut, Win, Spr
| Units: 6
| UG Reqs: GER:DB-Math, WAY-FR
CME 103:
Introduction to Matrix Methods (EE 103)
Introduction to applied linear algebra with emphasis on applications. Vectors, norm, and angle; linear independence and orthonormal sets. Matrices, left and right inverses, QR factorization. Least- squares and model fitting, regularization and cross-validation, time-series prediction, and other examples. Constrained least-squares; applications to least-norm reconstruction, optimal control, and portfolio optimization. Newton methods and nonlinear least-squares. Prerequisites: MATH 51 or CME 100.
Terms: Aut
| Units: 4-5
| UG Reqs: GER:DB-Math, WAY-FR
CME 104:
Linear Algebra and Partial Differential Equations for Engineers (ENGR 155B)
Linear algebra: matrix operations, systems of algebraic equations, Gaussian elimination, undetermined and overdetermined systems, coupled systems of ordinary differential equations, eigensystem analysis, normal modes. Fourier series with applications, partial differential equations arising in science and engineering, analytical solutions of partial differential equations. Numerical methods for solution of partial differential equations: iterative techniques, stability and convergence, time advancement, implicit methods, von Neumann stability analysis. Examples and applications from various engineering fields. Prerequisite: CME 102/ENGR 155A.
Terms: Spr
| Units: 5
| UG Reqs: GER:DB-Math, WAY-FR
CME 104A:
Linear Algebra and Partial Differential Equations for Engineers, ACE
Students attend CME104/ENGR155B lectures with additional recitation sessions; two to four hours per week, emphasizing engineering mathematical applications and collaboration methods. Prerequisite: application at:http://soe.stanford.edu/current_students/edp/programs/ace.html
Terms: Spr
| Units: 6
| UG Reqs: GER:DB-Math, WAY-FR
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. Topics in mathematical statistics: random sampling, point estimation, confidence intervals, hypothesis testing, non-parametric tests, regression and correlation analyses; applications in engineering, industrial manufacturing, medicine, biology, and other fields. Prerequisite: CME 100/ENGR154 or MATH 51.
Terms: Win, Sum
| Units: 3-4
| UG Reqs: GER:DB-Math, WAY-AQR, WAY-FR
CME 108:
Introduction to Scientific Computing (MATH 114)
Introduction to Scientific Computing Numerical computation for mathematical, computational, physical sciences and engineering: error analysis, floating-point arithmetic, nonlinear equations, numerical solution of systems of algebraic equations, banded matrices, least squares, unconstrained optimization, polynomial interpolation, numerical differentiation and integration, numerical solution of ordinary differential equations, truncation error, numerical stability for time dependent problems and stiffness. Implementation of numerical methods in MATLAB programming assignments. Prerequisites: MATH 51, 52, 53; prior programming experience (MATLAB or other language at level of CS 106A or higher).nGraduate students should take it for 3 units and undergraduate students should take it for 4 units.
Terms: Win, Sum
| Units: 3-4
| UG Reqs: GER:DB-EngrAppSci, WAY-AQR, WAY-FR
CME 151:
Introduction to Data Visualization
Bring your data to life with beautiful and interactive visualizations. This course is designed to provide practical experience on combining data science and graphic design to effectively communicate knowledge buried inside complex data. Each lecture will explore a different set of free industry-standard tools, for example d3.js, three.js, ggplots2, and processing; enabling students to think critically about how to architect their own interactive visualization for data exploration, web, presentations, and publications. Geared towards scientists and engineers, and with a particular emphasis on web, this course assumes an advanced background in programming methodology in multiple languages (particularly R and Javascript). Assignments are short and focus on visual experimentation with interesting data sets or the students' own data. Topics: data, visualization, web. Prerequisites: some experience with general programming is required to understand the lectures and assignments.
Terms: Win, Spr
| Units: 1
CME 181:
Projects in Applied and Computational Mathematics
Teams of students use techniques in applied and computational mathematics to tackle problems of their choosing. Students will have the opportunity to pursue open-ended projects in a variety of areas: economics, physics, political science, operations research, etc. Projects can cover (but are not limited to!) topics such as mathematical modeling of real-world phenomena (population dynamics), data-driven applications (movie recommendations) or complex systems in engineering (optimal control). Each team will be paired with a graduate student mentor working in applied and computational mathematics. Limited enrollment. Prerequisites: CME 100/102/104 or equivalents, or instructor consent. Recommended: CME 106/108 and familiarity with programming at the level of CME 192/193.
Terms: Spr
| Units: 3
CME 192:
Introduction to MATLAB
This short course runs for the first eight weeks 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.nThe 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
CME 193:
Introduction to Scientific Python
This short course runs for the first eight weeks of the quarter and is offered each quarter during the academic year. It is recommended for students who want to use Python in math, science, or engineering courses and for students who want to learn the basics of Python programming. The goal of the short course is to familiarize students with Python¿s tools for scientific computing. Lectures will be interactive with a focus on learning by example, and assignments will be application-driven. Some prior programming experience is highly recommended.nTopics covered include control flow, basic data structures, File I/O, and an introduction to NumPy/SciPy.
Terms: Aut, Win, Spr
| Units: 1
CME 194:
Introduction to MPI
This short course runs for the first four weeks of the quarter. Recommended for students interested in writing parallel programs. Focus is on distributed memory programming via the Message Passing Interface (MPI). Topics include: parallel decomposition, basic communication primitives, collective operations, and debugging. Interactive lectures and homework assignments require writing software. Students should be comfortable and interested in writing software in C/C++ but no prior parallel programming experience is required.
| Units: 1
CME 195:
Introduction to R (STATS 195)
This short course runs for the first four weeks of the quarter and is offered in fall and spring. It is recommended for students who want to use R in statistics, science, or engineering courses and for students who want to learn the basics of R programming. The goal of the short course is to familiarize students with R's tools for scientific computing. Lectures will be interactive with a focus on learning by example, and assignments will be application-driven. No prior programming experience is needed. Topics covered include basic data structures, File I/O, graphs, control structures, etc, and some useful packages in R.
Terms: Aut, Spr
| Units: 1
CME 196:
Practical Fortran
A five-week short course presenting the use of the Fortran programming language in science and engineering. Topics covered: basic language elements; good programming practices; testing and debugging; verification and validation; differences between Fortran-77 and Fortran-90 (95, 03, 08); calling numerical software libraries such as LAPACK; calling Fortran routines from C or C++; performance considerations. The course will be centered around solving ¿real¿ computational problems, emphasizing practice over theory. Programming proficiency in C/C++, or other modern compiled language, is required. Familiarity with the GNU development tools (compilers, debuggers, makefiles, etc.) is assumed. Prerequisites: CME 211 or equivalent.
Terms: Win, Spr
| Units: 1
CME 200:
Linear Algebra with Application to Engineering Computations (ME 300A)
Computer based solution of systems of algebraic equations obtained from engineering problems and eigen-system analysis, Gaussian elimination, effect of round-off error, operation counts, banded matrices arising from discretization of differential equations, ill-conditioned matrices, matrix theory, least square solution of unsolvable systems, solution of non-linear algebraic equations, eigenvalues and eigenvectors, similar matrices, unitary and Hermitian matrices, positive definiteness, Cayley-Hamilton theory and function of a matrix and iterative methods. Prerequisite: familiarity with computer programming, and MATH51.
Terms: Aut
| Units: 3
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: Aut, Win
| Units: 3
CME 206:
Introduction to Numerical Methods for Engineering (AA 214A, ME 300C)
Numerical methods from a user's point of view. Lagrange interpolation, splines. Integration: trapezoid, Romberg, Gauss, adaptive quadrature; numerical solution of ordinary differential equations: explicit and implicit methods, multistep methods, Runge-Kutta and predictor-corrector methods, boundary value problems, eigenvalue problems; systems of differential equations, stiffness. Emphasis is on analysis of numerical methods for accuracy, stability, and convergence. Introduction to numerical solutions of partial differential equations; Von Neumann stability analysis; alternating direction implicit methods and nonlinear equations. Prerequisites: CME 200/ME 300A, CME 204/ME 300B.
Terms: Aut, Spr
| Units: 3
CME 211:
Introduction to Programming for Scientists and Engineers (EARTHSCI 211)
Basic usage of the Python and C/C++ programming languages are introduced and used to solve representative computational problems from various science and engineering disciplines. Software design principles including time and space complexity analysis, data structures, object-oriented design, decomposition, encapsulation, and modularity are emphasized. Usage of campus wide Linux compute resources: login, file system navigation, editing files, compiling and linking, file transfer, etc. Versioning and revision control, software build utilities, and the LaTeX typesetting software are introduced and used to help complete individual programming assignments and a final project. Prerequisite: Some previous experience with programming (does not need to be a formal course in programming).
Terms: Aut
| Units: 3
CME 212:
Advanced Programming for Scientists and Engineers (ENERGY 212)
Advanced topics in software programming, debugging, and performance optimization are covered. The capabilities and usage of common libraries and frameworks such as BLAS, LAPACK, FFT, PETSc, and MKL/ACML are reviewed. Computer representation of integer and floating point numbers, and interoperability between C/C++ and Fortran is described. More advanced software engineering topics including: representing data in files, application checkpoint/restart, signals, unit and regression testing, and build automation. The use of debugging tools including static analysis, gdb, and Valgrind are introduced. An introduction to computer architecture covering processors, memory hierarchy, storage, and networking provides a foundation for understanding software performance. Profiles generated using gprof and perf are used to help guide the performance optimization process. Computational problems from various science and engineering disciplines will be used in individual and group assignments. Prerequisites: CME 200/ME 300A and CME 211 or equivalent level of programming proficiency in Python and C/C++.
Terms: Win
| Units: 3
CME 213:
Introduction to parallel computing using MPI, openMP, and CUDA (ME 339)
This class will give hands on experience with programming multicore processors, graphics processing units (GPU), and parallel computers. Focus will be on the message passing interface (MPI, parallel clusters) and the compute unified device architecture (CUDA, GPU). Topics will include: network topologies, modeling communication times, collective communication operations, parallel efficiency, MPI, dense linear algebra using MPI. Symmetric multiprocessing (SMP), pthreads, openMP. CUDA, combining MPI and CUDA, dense linear algebra using CUDA, sort, reduce and scan using CUDA. Pre-requisites include: C programming language and numerical algorithms (solution of differential equations, linear algebra, Fourier transforms).
Terms: Spr
| Units: 3
CME 213B:
Parallel Computing Projects
Students will discuss, devise and implement parallel applications for a discipline of mutual interest. The parallel implementation will focus on the use of MPI for clusters, OpenMP for multicore processors, and/or CUDA for GPU processors. Instructors will help guide students to relevant literature and resources. A short introduction to MPI, OpenMP, and CUDA will be given at the beginning of the quarter. Hardware will be available for the duration of the quarter including NVIDIA Jetson TK1 development kits, and the ICME GPU cluster. Prerequisites: CME 211/212 or equivalent.
Terms: Win
| Units: 3
CME 215A:
Advanced Computational Fluid Dynamics (AA 215A)
High resolution schemes for capturing shock waves and contact discontinuities; upwinding and artificial diffusion; LED and TVD concepts; alternative flow splittings; numerical shock structure. Discretization of Euler and Navier Stokes equations on unstructured meshes; the relationship between finite volume and finite element methods. Time discretization; explicit and implicit schemes; acceleration of steady state calculations; residual averaging; math grid preconditioning. Automatic design; inverse problems and aerodynamic shape optimization via adjoint methods. Pre- or corequisite: 214B or equivalent.
Terms: Win
| Units: 3
CME 232:
Introduction to Computational Mechanics (ME 332)
Provides an introductory overview of modern computational methods for problems arising primarily in mechanics of solids and is intended for students from various engineering disciplines. The course reviews the basic theory of linear solid mechanics and introduces students to the important concept of variational forms, including the principle of minimum potential energy and the principles of virtual work. Specific model problems that will be considered include deformation of bars, beams and membranes, plates, and problems in plane elasticity (plane stress, plane strain, axisymmetric elasticity). The variational forms of these problems are used as the starting point for developing the finite element method (FEM) and boundary element method (BEM) approaches providing an important connection between mechanics and computational methods.
Terms: Sum
| Units: 3
CME 242:
Mathematical and Computational Finance Seminar (STATS 239)
| Units: 1
| Repeatable
for credit
CME 243:
Financial Models and Statistical Methods in Active Risk Management (STATS 243)
(SCPD students register for 243P.) Market risk and credit risk, credit markets. Back testing, stress testing and Monte Carlo methods. Logistic regression, generalized linear models and generalized mixed models. Loan prepayment and default as competing risks. Survival and hazard functions, correlated default intensities, frailty and contagion. Risk surveillance, early warning and adaptive control methodologies. Banking and bank regulation, asset and liability management. Prerequisite: STATS 240 or equivalent.
Terms: Win
| Units: 2-4
CME 244:
Project Course in Mathematical and Computational Finance
For graduate students in the MCF track; students will work individually or in groups on research projects.
| Units: 1-6
CME 245:
Topics in Mathematical and Computational Finance
Current topics for enrolled students in the MCF program; can be repeated up to three times.
Terms: Aut, Win, Spr, Sum
| Units: 1
| Repeatable
3 times
(up to 3 units total)
CME 250:
Introduction to Machine Learning
A Shhort course presenting the principles behind when, why, and how to apply modern machine learning algorithms. We will discuss a framework for reasoning about when to apply various machine learning techniques, emphasizing questions of over-fitting/under-fitting, regularization, interpretability, supervised/unsupervised methods, and handling of missing data. The principles behind various algorithms--the why and how of using them--will be discussed, while some mathematical detail underlying the algorithms--including proofs--will not be discussed. Unsupervised machine learning algorithms presented will include k-means clustering, principal component analysis (PCA), and independent component analysis (ICA). Supervised machine learning algorithms presented will include support vector machines (SVM), classification and regression trees (CART), boosting, bagging, and random forests. Imputation, the lasso, and cross-validation concepts will also be covered. The R programming language will be used for examples, though students need not have prior exposure to R. Prerequisite: undergraduate-level linear algebra and statistics; basic programming experience (R/Matlab/Python).
Terms: Win, Spr
| Units: 1
CME 263:
Introduction to Linear Dynamical Systems (EE 263)
Applied linear algebra and linear dynamical systems with application to circuits, signal processing, communications, and control systems. Topics: least-squares approximations of over-determined equations and least-norm solutions of underdetermined equations. Symmetric matrices, matrix norm, and singular value decomposition. Eigenvalues, left and right eigenvectors, with dynamical interpretation. Matrix exponential, stability, and asymptotic behavior. Multi-input/multi-output systems, impulse and step matrices; convolution and transfer matrix descriptions. Control, reachability, and state transfer; observability and least-squares state estimation. Prerequisites: linear algebra and matrices as in MATH 103; differential equations and Laplace transforms as in EE 102A.
Terms: Aut, Sum
| Units: 3
CME 291:
Master's Research
Students require faculty sponsor. (Staff)
Terms: Aut, Win, Spr, Sum
| Units: 1-6
| Repeatable
for credit
Instructors: ;
Aiken, A. (PI);
Alonso, J. (PI);
Bambos, N. (PI);
Biondi, B. (PI);
Boneh, D. (PI);
Bosagh Zadeh, R. (PI);
Boyd, S. (PI);
Butte, A. (PI);
Candes, E. (PI);
Carlsson, G. (PI);
Constantinou, C. (PI);
Darve, E. (PI);
Davis, R. (PI);
Diaconis, P. (PI);
Donoho, D. (PI);
Farhat, C. (PI);
Fedkiw, R. (PI);
Feinstein, J. (PI);
Fringer, O. (PI);
Fruchter, R. (PI);
Gerritsen, M. (PI);
Giesecke, K. (PI);
Glynn, P. (PI);
Goel, A. (PI);
Golub, G. (PI);
Guibas, L. (PI);
Hanrahan, P. (PI);
Harris, J. (PI);
Jain, K. (PI);
Jameson, A. (PI);
Johari, R. (PI);
Kahn, S. (PI);
Kamvar, S. (PI);
Khayms, V. (PI);
Koltun, V. (PI);
Langley, P. (PI);
Lele, S. (PI);
Leskovec, J. (PI);
Levinson, D. (PI);
Lew, A. (PI);
Liu, T. (PI);
Manning, C. (PI);
McFarland, D. (PI);
Mignot, E. (PI);
Moin, P. (PI);
Murray, W. (PI);
Napel, S. (PI);
Ng, A. (PI);
Papanicolaou, G. (PI);
Rajaratnam, B. (PI);
Reed, E. (PI);
Saberi, A. (PI);
Saunders, M. (PI);
Shaqfeh, E. (PI);
Taylor, C. (PI);
Wara, M. (PI);
Wechsler, R. (PI);
Wong, W. (PI);
Ye, Y. (PI);
Zenios, S. (PI);
Siroker, M. (GP);
Woo, Y. (GP)
CME 292:
Advanced MATLAB for Scientific Computing
Short course running first four weeks of the quarter (8 lectures) with interactive lectures and application based assignment. Students will be introduced to advanced MATLAB features, syntaxes, and toolboxes not traditionally found in introductory courses. Material will be reinforced with in-class examples, demos, and homework assignment involving topics from scientific computing. MATLAB topics will be drawn from: advanced graphics (2D/3D plotting, graphics handles, publication quality graphics, animation), MATLAB tools (debugger, profiler), code optimization (vectorization, memory management), object-oriented programming, compiled MATLAB (MEX files and MATLAB coder), interfacing with external programs, toolboxes (optimization, parallel computing, symbolic math, PDEs). Scientific computing topics will include: numerical linear algebra, numerical optimization, ODEs, and PDEs.
Terms: Aut, Win, Spr
| Units: 1
CME 300:
First Year Seminar Series
Required for first-year ICME Ph.D. students; recommended for first-year ICME M.S. students. Presentations about research at Stanford by faculty and researchers from Engineering, H&S, and organizations external to Stanford. May be repeated for credit.
Terms: Aut, Win, Spr
| Units: 1
| Repeatable
for credit
CME 302:
Numerical Linear Algebra
First in a three quarter graduate sequence. Solution of systems of linear equations: direct methods, error analysis, structured matrices; iterative methods and least squares. Parallel techniques. Prerequisites: CME 108, MATH 103 or 113.
Terms: Aut
| Units: 3
CME 303:
Partial Differential Equations of Applied Mathematics (MATH 220)
First-order partial differential equations; method of characteristics; weak solutions; elliptic, parabolic, and hyperbolic equations; Fourier transform; Fourier series; and eigenvalue problems. Prerequisite: foundation in multivariable calculus and ordinary differential equations.
Terms: Aut
| Units: 3
CME 304:
Numerical Optimization (MS&E 315)
Solution of nonlinear equations; unconstrained optimization; linear programming; quadratic programming; global optimization; general linearly and nonlinearly constrained optimization. Theory and algorithms to solve these problems. Prerequisite: background in analysis and numerical linear algebra.
Terms: Win
| Units: 3
CME 305:
Discrete Mathematics and Algorithms (MS&E 316)
Topics: Basic Algebraic Graph Theory, Matroids and Minimum Spanning Trees, Submodularity and Maximum Flow, NP-Hardness, Approximation Algorithms, Randomized Algorithms, The Probabilistic Method, and Spectral Sparsification using Effective Resistances. Topics will be illustrated with applications from Distributed Computing, Machine Learning, and large-scale Optimization. Prerequisites: CS 261 is highly recommended, although not required.
Terms: Win
| Units: 3
CME 306:
Numerical Solution of Partial Differential Equations (MATH 226)
Hyperbolic partial differential equations: stability, convergence and qualitative properties; nonlinear hyperbolic equations and systems; combined solution methods from elliptic, parabolic, and hyperbolic problems. Examples include: Burger's equation, Euler equations for compressible flow, Navier-Stokes equations for incompressible flow. Prerequisites: MATH 220A or CME 302.
Terms: Spr
| Units: 3
CME 308:
Stochastic Methods in Engineering (MATH 228)
Review of basic probability; Monte Carlo simulation; state space models and time series; parameter estimation, prediction, and filtering; Markov chains and processes; stochastic control; and stochastic differential equations. Examples from various engineering disciplines. Prerequisites: exposure to probability; background in real variables and analysis.
Terms: Spr
| Units: 3
CME 309:
Randomized Algorithms and Probabilistic Analysis (CS 265)
Randomness pervades the natural processes around us, from the formation of networks, to genetic recombination, to quantum physics. Randomness is also a powerful tool that can be leveraged to create algorithms and data structures which, in many cases, are more efficient and simpler than their deterministic counterparts. This course covers the key tools of probabilistic analysis, and application of these tools to understand the behaviors of random processes and algorithms. Emphasis is on theoretical foundations, though we will apply this theory broadly, discussing applications in machine learning and data analysis, networking, and systems. Topics include tail bounds, the probabilistic method, Markov chains, and martingales, with applications to analyzing random graphs, metric embeddings, random walks, and a host of powerful and elegant randomized algorithms. Prerequisites: CS 161 and STAT 116, or equivalents and instructor consent.
Terms: Aut
| Units: 3
CME 322:
Spectral Methods in Computational Physics (ME 408)
Data analysis, spectra and correlations, sampling theorem, nonperiodic data, and windowing; spectral methods for numerical solution of partial differential equations; accuracy and computational cost; fast Fourier transform, Galerkin, collocation, and Tau methods; spectral and pseudospectral methods based on Fourier series and eigenfunctions of singular Sturm-Liouville problems; Chebyshev, Legendre, and Laguerre representations; convergence of eigenfunction expansions; discontinuities and Gibbs phenomenon; aliasing errors and control; efficient implementation of spectral methods; spectral methods for complicated domains; time differencing and numerical stability.
Terms: Win
| Units: 3
CME 323:
Distributed Algorithms and Optimization
The emergence of large distributed clusters of commodity machines has brought with it a slew of new algorithms and tools. Many fields such as Machine Learning and Optimization have adapted their algorithms to handle such clusters. Topics include distributed algorithms for: Optimization, Numerical Linear Algebra, Machine Learning, Graph analysis, Streaming and online algorithms, and other problems that are challenging to scale on a commodity cluster. Throughout the class, topics will be illustrated with hands-on exercises using the high-speed cluster programming framework, Spark, with computing resources provided by the instructor.
Terms: Spr
| Units: 3
CME 330:
Applied Mathematics in the Chemical and Biological Sciences (CHEMENG 300)
Mathematical solution methods via applied problems including chemical reaction sequences, mass and heat transfer in chemical reactors, quantum mechanics, fluid mechanics of reacting systems, and chromatography. Topics include generalized vector space theory, linear operator theory with eigenvalue methods, phase plane methods, perturbation theory (regular and singular), solution of parabolic and elliptic partial differential equations, and transform methods (Laplace and Fourier). Prerequisites: CME 102/ENGR 155A and CME 104/ENGR 155B, or equivalents.
Terms: Aut
| Units: 3
CME 334:
Advanced Methods in Numerical Optimization (MS&E 312)
Topics include interior-point methods, relaxation methods for nonlinear discrete optimization, sequential quadratic programming methods, optimal control and decomposition methods. Topic chosen in first class; different topics for individuals or groups possible. Individual or team projects. May be repeated for credit.
Terms: Aut
| Units: 3
| Repeatable
for credit
CME 335:
Advanced Topics in Numerical Linear Algebra
Possible topics: Approximate invariant subspaces and Krylov decompositions, modern interpretations of the Hessenberg QR algorithm, accurate symmetric factorizations (e.g., Bunch-Kaufman), low-rank modifications of factorizations, sparse-direct factorizations, and, if time permits, a small selection of topics chosen by the students.Prerequisite - CME 302: Numerical Linear Algebra
Terms: Win
| Units: 3
| Repeatable
for credit
CME 336:
Linear and Conic Optimization with Applications (MS&E 314)
Linear, semidefinite, conic, and convex nonlinear optimization problems as generalizations of classical linear programming. Algorithms include the interior-point, barrier function, and cutting plane methods. Related convex analysis, including the separating hyperplane theorem, Farkas lemma, dual cones, optimality conditions, and conic inequalities. Complexity and/or computation efficiency analysis. Applications to combinatorial optimization, sensor network localization, support vector machine, and graph realization. Prerequisite: MS&E 211 or equivalent.
Terms: Win
| Units: 3
CME 337:
Spectral Graph Theory and Algorithmic Applications (MS&E 337)
Brings students to the forefront of a very active area of research. Reviews classic results relating graph expansion and spectra, random walks, random spanning trees, and their electrical network representation. Covers recent progress on graph sparsification, Kadison-Singer problem and approximation algorithms for traveling salesman problems.
Terms: Spr
| Units: 3
CME 338:
Large-Scale Numerical Optimization (MS&E 318)
The main algorithms and software for constrained optimization emphasizing the sparse-matrix methods needed for their implementation. Iterative methods for linear equations and least squares. The simplex method. Basis factorization and updates. Interior methods. The reduced-gradient method, augmented Lagrangian methods, and SQP methods. Prerequisites: Basic numerical linear algebra, including LU, QR, and SVD factorizations, and an interest in MATLAB, sparse-matrix methods, and gradient-based algorithms for constrained optimization. Recommended: MS&E 310, 311, 312, 314, or 315; CME 108, 200, 302, 304, 334, or 335.
Terms: Spr
| Units: 3
CME 356:
Engineering Functional Analysis and Finite Elements (ME 412)
Concepts in functional analysis to understand models and methods used in simulation and design. Topology, measure, and integration theory to introduce Sobolev spaces. Convergence analysis of finite elements for the generalized Poisson problem. Extensions to convection-diffusion-reaction equations and elasticity. Upwinding. Mixed methods and LBB conditions. Analysis of nonlinear and evolution problems. Prerequisites: 335A,B, CME 200, CME 204, or consent of instructor. Recommended: 333, MATH 171.
Terms: Win
| Units: 3
CME 362:
An Introduction to Compressed Sensing (STATS 330)
Compressed sensing is a new data acquisition theory asserting that one can design nonadaptive sampling techniques that condense the information in a compressible signal into a small amount of data. This revelation may change the way engineers think about signal acquisition. Course covers fundamental theoretical ideas, numerical methods in large-scale convex optimization, hardware implementations, connections with statistical estimation in high dimensions, and extensions such as recovery of data matrices from few entries (famous Netflix Prize).
Terms: Aut
| Units: 3
CME 364A:
Convex Optimization I (CS 334A, EE 364A)
Convex sets, functions, and optimization problems. The basics of convex analysis and theory of convex programming: optimality conditions, duality theory, theorems of alternative, and applications. Least-squares, linear and quadratic programs, semidefinite programming, and geometric programming. Numerical algorithms for smooth and equality constrained problems; interior-point methods for inequality constrained problems. Applications to signal processing, communications, control, analog and digital circuit design, computational geometry, statistics, machine learning, and mechanical engineering. Prerequisite: linear algebra such as EE263, basic probability.
Terms: Win, Sum
| Units: 3
CME 364B:
Convex Optimization II (EE 364B)
Continuation of 364A. Subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Monotone operators and proximal methods; alternating direction method of multipliers. Exploiting problem structure in implementation. Convex relaxations of hard problems. Global optimization via branch and bound. Robust and stochastic optimization. Applications in areas such as control, circuit design, signal processing, and communications. Course requirements include project. Prerequisite: 364A.
Terms: Spr
| Units: 3
CME 371:
Computational Biology in Four Dimensions (BIOMEDIN 371, BIOPHYS 371, CS 371)
Computational approaches to understanding the three-dimensional spatial organization of biological systems and how that organization evolves over time. The course will cover cutting-edge research in both physics-based simulation and computational analysis of experimental data, at scales ranging from individual molecules to entire cells. Prerequisite: CS 106A or equivalent, and an introductory course in biology or biochemistry. Recommended: some experience in mathematical modeling (does not need to be a formal course).
Terms: Spr
| Units: 3
CME 375:
Advanced Topics in Convex Optimization (MATH 301)
Modern developments in convex optimization: semidefinite programming; novel and efficient first-order algorithms for smooth and nonsmooth convex optimization. Emphasis on numerical methods suitable for large scale problems arising in science and engineering. Prerequisites: convex optimization (EE 364), linear algebra (Math 104), numerical linear algebra (CME 302); background in probability, statistics, real analysis and numerical optimization.
Terms: Win
| Units: 3
| Repeatable
3 times
(up to 9 units total)
CME 390:
Curricular Practical Training
May be repeated three times for credit.
Terms: Aut, Win, Spr, Sum
| Units: 1
| Repeatable
3 times
(up to 3 units total)
CME 399:
Special Research Topics in Computational and Mathematical Engineering
Graduate-level research work not related to report, thesis, or dissertation. May be repeated for credit.
Terms: Aut, Win, Spr, Sum
| Units: 1-15
| Repeatable
6 times
(up to 30 units total)
Terms: Aut, Win, Spr, Sum
| Units: 1-15
| Repeatable
for credit
Instructors: ;
Alonso, J. (PI);
Athey, S. (PI);
Bambos, N. (PI);
Beroza, G. (PI);
Boahen, K. (PI);
Boneh, D. (PI);
Bosagh Zadeh, R. (PI);
Boyd, S. (PI);
Candes, E. (PI);
Carlsson, G. (PI);
Darve, E. (PI);
Delp, S. (PI);
Diaconis, P. (PI);
Donoho, D. (PI);
Dror, R. (PI);
Farhat, C. (PI);
Fedkiw, R. (PI);
Fringer, O. (PI);
Genesereth, M. (PI);
Gerritsen, M. (PI);
Giesecke, K. (PI);
Glynn, P. (PI);
Goel, A. (PI);
Golub, G. (PI);
Guibas, L. (PI);
Hanrahan, P. (PI);
Hastie, T. (PI);
Holmes, S. (PI);
Hong, H. (PI);
Iaccarino, G. (PI);
Jameson, A. (PI);
Johari, R. (PI);
Kamvar, S. (PI);
Khatib, O. (PI);
Khayms, V. (PI);
Kitanidis, P. (PI);
Kosovichev, A. (PI);
Kumar, S. (PI);
Lai, T. (PI);
Langley, P. (PI);
Lee, P. (PI);
Lele, S. (PI);
Leskovec, J. (PI);
Levinson, D. (PI);
Levitt, M. (PI);
Lew, A. (PI);
Linder, C. (PI);
Liu, T. (PI);
Moerner, W. (PI);
Moin, P. (PI);
Montanari, A. (PI);
Motwani, R. (PI);
Murray, W. (PI);
Ng, A. (PI);
Pande, V. (PI);
Papanicolaou, G. (PI);
Pitsch, H. (PI);
Plevritis, S. (PI);
Poulson, J. (PI);
Rajagopal, R. (PI);
Rajaratnam, B. (PI);
Reed, E. (PI);
Roughgarden, T. (PI);
Saberi, A. (PI);
Salisbury, J. (PI);
Saunders, M. (PI);
Shaqfeh, E. (PI);
Taylor, C. (PI);
Tchelepi, H. (PI);
Tibshirani, R. (PI);
Wein, L. (PI);
Weissman, T. (PI);
Wong, W. (PI);
Xing, L. (PI);
Ye, Y. (PI);
Ying, L. (PI);
Longinidis, K. (GP);
Siroker, M. (GP)
CME 444:
Computational Consulting
Advice by graduate students under supervision of ICME faculty. Weekly briefings with faculty adviser and associated faculty to discuss ongoing consultancy projects and evaluate solutions. May be repeated for credit.
Terms: Aut, Win, Spr
| Units: 1-3
| Repeatable
for credit
CME 500:
Departmental Seminar
Weekly research lectures by experts from academia, national laboratories, industry, and doctoral students. May be repeated for credit. In autumn and winter 2014-15, this seminar will predominantly feature current graduate students talking about their research.
Terms: Aut, Win, Spr
| Units: 1
| Repeatable
for credit
CME 510:
Linear Algebra and Optimization Seminar
Recent developments in numerical linear algebra and numerical optimization. Guest speakers from other institutions and local industry. Goal is to bring together scientists from different theoretical and application fields to solve complex scientific computing problems. May be repeated for credit.
Terms: Aut, Win, Spr
| Units: 1
| Repeatable
for credit
Terms: Aut, Win, Spr, Sum
| Units: 0
| Repeatable
for credit
Instructors: ;
Alonso, J. (PI);
Bambos, N. (PI);
Boneh, D. (PI);
Boyd, S. (PI);
Carlsson, G. (PI);
Darve, E. (PI);
Diaconis, P. (PI);
Donoho, D. (PI);
Farhat, C. (PI);
Fedkiw, R. (PI);
Fringer, O. (PI);
Gerritsen, M. (PI);
Glynn, P. (PI);
Goel, A. (PI);
Golub, G. (PI);
Guibas, L. (PI);
Hanrahan, P. (PI);
Harris, J. (PI);
Iaccarino, G. (PI);
Jameson, A. (PI);
Johari, R. (PI);
Kamvar, S. (PI);
Khayms, V. (PI);
Kosovichev, A. (PI);
Kumar, S. (PI);
Langley, P. (PI);
Lele, S. (PI);
Lew, A. (PI);
Moin, P. (PI);
Motwani, R. (PI);
Murray, W. (PI);
Papanicolaou, G. (PI);
Saberi, A. (PI);
Saunders, M. (PI);
Shaqfeh, E. (PI);
Taylor, C. (PI);
Wein, L. (PI);
Wong, W. (PI);
Xing, L. (PI);
Ye, Y. (PI)
CME 802:
TGR Dissertation
Terms: Aut, Win, Spr, Sum
| Units: 0
| Repeatable
for credit
Instructors: ;
Alonso, J. (PI);
Andrews, J. (PI);
Athey, S. (PI);
Bambos, N. (PI);
Boneh, D. (PI);
Boyd, S. (PI);
Candes, E. (PI);
Carlsson, G. (PI);
Darve, E. (PI);
Diaconis, P. (PI);
Donoho, D. (PI);
Farhat, C. (PI);
Fedkiw, R. (PI);
Fringer, O. (PI);
Gerritsen, M. (PI);
Giesecke, K. (PI);
Glynn, P. (PI);
Goel, A. (PI);
Golub, G. (PI);
Guibas, L. (PI);
Hanrahan, P. (PI);
Hong, H. (PI);
Iaccarino, G. (PI);
Jameson, A. (PI);
Johari, R. (PI);
Kamvar, S. (PI);
Khatib, O. (PI);
Khayms, V. (PI);
Kitanidis, P. (PI);
Kosovichev, A. (PI);
Kumar, S. (PI);
Lai, T. (PI);
Langley, P. (PI);
Lele, S. (PI);
Leskovec, J. (PI);
Levitt, M. (PI);
Lew, A. (PI);
Liu, T. (PI);
Moerner, W. (PI);
Moin, P. (PI);
Motwani, R. (PI);
Murray, W. (PI);
Papanicolaou, G. (PI);
Pinsky, P. (PI);
Pitsch, H. (PI);
Rajaratnam, B. (PI);
Reed, E. (PI);
Roughgarden, T. (PI);
Saberi, A. (PI);
Salisbury, J. (PI);
Saunders, M. (PI);
Shaqfeh, E. (PI);
Taylor, C. (PI);
Taylor, J. (PI);
Wein, L. (PI);
Wong, W. (PI);
Xing, L. (PI);
Ye, Y. (PI);
Longinidis, K. (GP);
Pham, J. (GP);
Siroker, M. (GP)
CME 184:
Startup Engineering
Spiritual sequel to Peter Thiel's CS 183 course on startups. A new course that bridges the gap between academic computer science and production software engineering. Fast-paced introduction to key tools and techniques (command line, dotfiles, text editor, distributed version control, debugging, testing, documentation, reading code, deployments), featuring guest appearances by senior engineers from successful startups and large-scale academic projects including Uber, Square, Stripe, AirBnB, Twilio, Taskrabbit, Judicata, Counsyl, Asana, Heroku, and Twitter. Over the course of the class, students will build a command line application, expose it as a web service, and then link other students' applications and services together to build an HTML5 mobile app. General principles are illustrated through modern Javascript and the latest web technologies, including Node, Backbone, Coffeescript, Bootstrap, Git, and Github. Prerequisites: Basic computer science as per CS 106B. Recommended: some familiarity with HTML, CSS, and Javascript.
| Units: 3
CME 214:
Software Design in Modern Fortran for Scientists and Engineers (EARTHSCI 214)
This course introduces software design and development in modern Fortran. Course covers the functional, object-oriented-, and parallel programming features introduced in the Fortran 95, 2003, and 2008 standards, respectively, in the context of numerical approximations to ordinary and partial differential equations; introduces object-oriented design and design schematics based on the Unified Modeling Language (UML) structure, behavior, and interaction diagrams; cover the basic use of several open-source tools for software building, testing, documentation generation, and revision control. Recommended: Familiarity with programming in Fortran 90, basic numerical analysis and linear algebra, or instructor approval
| Units: 3
CME 215B:
Advanced Computational Fluid Dynamics (AA 215B)
High resolution schemes for capturing shock waves and contact discontinuities; upwinding and artificial diffusion; LED and TVD concepts; alternative flow splittings; numerical shock structure. Discretization of Euler and Navier Stokes equations on unstructured meshes; the relationship between finite volume and finite element methods. Time discretization; explicit and implicit schemes; acceleration of steady state calculations; residual averaging; math grid preconditioning. Automatic design; inverse problems and aerodynamic shape optimization via adjoint methods. Pre- or corequisite: 214B or equivalent.
| Units: 3
CME 239B:
Workshop in Quantitative Finance (STATS 239B)
Topics of current interest. May be repeated for credit.
| Units: 1
| Repeatable
for credit
CME 321A:
Mathematical Methods of Imaging (MATH 221A)
Image denoising and deblurring with optimization and partial differential equations methods. Imaging functionals based on total variation and l-1 minimization. Fast algorithms and their implementation.
| Units: 3
CME 321B:
Mathematical Methods of Imaging (MATH 221B)
Array imaging using Kirchhoff migration and beamforming, resolution theory for broad and narrow band array imaging in homogeneous media, topics in high-frequency, variable background imaging with velocity estimation, interferometric imaging methods, the role of noise and inhomogeneities, and variational problems that arise in optimizing the performance of array imaging algorithms.
| Units: 3
CME 325:
Numerical Approximations of Partial Differential Equations in Theory and Practice
Finite volume and finite difference methods for initial boundary value problems in multiple space dimensions. Emphasis is on formulation of boundary conditions for the continuous and the discrete problems. Analysis of numerical methods with respect to stability, accuracy, and error behavior. Techniques of treating non-rectangular domains, and effects of non-regular grids.
| Units: 1-2
CME 326:
Numerical Methods for Initial Boundary Value Problems
Initial boundary value problems model many phenomena in engineering and science such as, fluid flow problems, wave propagation, fluid-structure interaction, conjugate heat transfer and financial mathematics. We discuss numerical techniques for such simulations and focus on the underlying principles and theoretical understanding. Emphasis is on stability, convergence and efficiency for methods applied to hyperbolic and parabolic initial boundary value problems.
| Units: 3
CME 327:
Numerical Methods for Stiff Problems
Focus is on analysis of numerical techniques for stiff ordinary differential equations, including those resulting from spatial discretization of partial differential equations. Topics include stiffness, convergence, stability, adaptive time stepping, implicit time-stepping methods (SDIRK, Rosenbrock), linear and nonlinear system solvers (Fixed Point, Newton, Multigrid, Krylov subspace methods) and preconditioning. Pre-requisites: CME200/ME300A or equivalent; or consent of instructor.
| Units: 3
CME 328:
Advanced Topics in Partial Differential Equations
Contents change each time and is taught as a topics course, most likely by a faculty member visiting from another institution. May be repeated for credit. Topic in 2012-13: numerical solution of time-dependent partial differential equations is a fundamental tool for modeling and prediction in many areas of science and engineering. In this course we explore the stability, accuracy, efficiency, and appropriateness of specialized temporal integration strategies for different classes of partial differential equations including stiff problems and fully implicit methods, operator splitting and semi-implicit methods, extrapolation methods, multirate time integration, multi-physics problems, symplectic integration, and temporal parallelism. Prerequisites: recommended CME303 and 306 or with instructor's consent.
| Units: 3
CME 329:
Top Ten Algorithms of the 20th Century (MATH 310)
A high-level survey course covering one algorithm per week: metropolis, simplex method, conjugate gradient, QR, quicksort, fast fourier transform, maxcut, fast multipole method, integer relation detection, and convex/semi-definite programming.
| Units: 3
CME 342:
Parallel Methods in Numerical Analysis
Emphasis is on techniques for obtaining maximum parallelism in numerical algorithms, especially those occurring when solving matrix problems, partial differential equations, and the subsequent mapping onto the computer. Implementation issues on parallel computers. Topics: parallel architecture, programming models (MPI, GPU Computing with CUDA ¿ quick review), matrix computations, FFT, fast multiple methods, domain decomposition, graph partitioning, discrete algorithms. Prerequisites: 302 or 200 (ME 300A), 213 or equivalent, or consent of instructor. Recommended: differential equations and knowledge of a high-level programming language such as C or C++ (F90/95 also allowable).
| Units: 3
CME 345:
Model Reduction
Model reduction is an indispensable tool for computational-based design and optimization, statistical analysis, embedded computing, and real-time optimal control. This course presents the basic mathematical theory for projection-based model reduction. Topics include: notions of linear dynamical systems and projection; projection-based model reduction; error analysis; proper orthogonal decomposition; Hankel operator and balancing of a linear dynamical system; balanced truncation method: modal truncation and other reduction methods for linear oscillators; model reduction via moment matching methods based on Krylov subspaces; introduction to model reduction of parametric systems and notions of nonlinear model reduction. Course material is complemented by a balanced set of theoretical, algorithmic and Matlab computer programming assignments. Prerequisites: CME 200 or equivalent, CME 263 or equivalent and basic numerical methods for ODEs.
| Units: 3
CME 358:
Finite Element Method for Fluid Mechanics
Mathematical theory of the finite element method for incompressible flows; related computational algorithms and implementation details. Poisson equation; finite element method for simple elliptic problems; notions of mathematical analysis of non-coercive partial differential equations; the inf-sup or Babushka-Brezzi condition and its applications to the Stokes and Darcy problems; presentation of stable mixed finite element methods and corresponding algebraic solvers; stabilization approaches in the context of advection-diffusion equation; numerical solution of the incompressible Navier-Stokes equations by finite element method. Theoretical, computational, and MATLAB computer programming assignments. Prerequisites: foundation in multivariate calculus and ME 335A or equivalent.
| Units: 3
CME 372:
Applied Fourier Analysis and Elements of Modern Signal Processing (MATH 262)
Introduction to the mathematics of the Fourier transform and how it arises in a number of imaging problems. Mathematical topics include the Fourier transform, the Plancherel theorem, Fourier series, the Shannon sampling theorem, the discrete Fourier transform, and the spectral representation of stationary stochastic processes. Computational topics include fast Fourier transforms (FFT) and nonuniform FFTs. Applications include Fourier imaging (the theory of diffraction, computed tomography, and magnetic resonance imaging) and the theory of compressive sensing.
| Units: 3
CME 520:
Topics in Simulation of Human Physiology & Anatomical Systems (SURG 253)
Biweekly interdisciplinary lecture series on the development of computational tools for modeling and simulation of human physiological and anatomical systems. Lectures by instructors and guest speakers on topics such as surgical simulation, anatomical & surgical Modeling, neurological Systems, and biomedical models of human movement. Group discussions, team based assignments, and project work.nPrerequisite: Medical students, residents or fellows from school of medicine, and computationally oriented students with a strong interest to explore computational and mathematical methods related to the health sciences.
| Units: 1
| Repeatable
for credit
(up to 99 units total)
