CME 200: Linear Algebra with Application to Engineering Computations (ME 300A)
Computer based solution of systems of algebraic equations obtained from engineering problems and eigensystem analysis, Gaussian elimination, effect of roundoff error, operation counts, banded matrices arising from discretization of differential equations, illconditioned matrices, matrix theory, least square solution of unsolvable systems, solution of nonlinear algebraic equations, eigenvalues and eigenvectors, similar matrices, unitary and Hermitian matrices, positive definiteness, CayleyHamilton theory and function of a matrix and iterative methods. Prerequisite: familiarity with computer programming, and
MATH51.
Terms: Aut

Units: 3

Grading: Letter or Credit/No Credit
Instructors:
Iaccarino, G. (PI)
;
Dibua, O. (TA)
;
Lyman, L. (TA)
...
more instructors for CME 200 »
Instructors:
Iaccarino, G. (PI)
;
Dibua, O. (TA)
;
Lyman, L. (TA)
;
Maher, G. (TA)
;
Tazhimbetov, N. (TA)
MATH 51: Linear Algebra, Multivariable Calculus, and Modern Applications
This course provides unified coverage of linear algebra and multivariable differential calculus. It discusses applications connecting the material to many quantitative fields. Linear algebra in large dimensions underlies the scientific, datadriven, and computational tasks of the 21st century. The linear algebra portion of the course includes orthogonality, linear independence, matrix algebra, and eigenvalues as well as ubiquitious applications: least squares, linear regression, Markov chains (relevant to population dynamics, molecular chemistry, and PageRank), singular value decomposition (essential in image compression, topic modeling, and dataintensive work in the natural sciences), and more. The multivariable calculus material includes unconstrained optimization via gradients and Hessians (used for energy minimization in physics and chemistry), constrained optimization (via Lagrange multipliers, crucial in economics), gradient descent and the multivariable Chain Rule (which underl
more »
This course provides unified coverage of linear algebra and multivariable differential calculus. It discusses applications connecting the material to many quantitative fields. Linear algebra in large dimensions underlies the scientific, datadriven, and computational tasks of the 21st century. The linear algebra portion of the course includes orthogonality, linear independence, matrix algebra, and eigenvalues as well as ubiquitious applications: least squares, linear regression, Markov chains (relevant to population dynamics, molecular chemistry, and PageRank), singular value decomposition (essential in image compression, topic modeling, and dataintensive work in the natural sciences), and more. The multivariable calculus material includes unconstrained optimization via gradients and Hessians (used for energy minimization in physics and chemistry), constrained optimization (via Lagrange multipliers, crucial in economics), gradient descent and the multivariable Chain Rule (which underlie many machine learning algorithms, such as backpropagation), and Newton's method (a crucial part of how GPS works). The course emphasizes computations alongside an intuitive understanding of key ideas, making students wellprepared for further study of mathematics and its applications to other fields. The widespread use of computers makes it more important, not less, for users of math to understand concepts: in all scientific fields, novel users of quantitative tools in the future will be those who understand ideas and how they fit with applications and examples. This is the only course at Stanford whose syllabus includes nearly all the math background for
CS 229, which is why
CS 229 and
CS 230 specifically recommend it (or other courses resting on it). For frequently asked questions about the differences between
Math 51 and
CME 100, see the FAQ on the placement page on the math department website. Prerequisite: 21, 42, or the math placement diagnostic (offered through the Math Department website) in order to register for this course.
Terms: Aut, Win, Spr

Units: 5

UG Reqs: GER:DBMath, WAYFR

Grading: Letter or Credit/No Credit
Instructors:
Church, T. (PI)
;
Conrad, B. (PI)
;
Lucianovic, M. (PI)
...
more instructors for MATH 51 »
Instructors:
Church, T. (PI)
;
Conrad, B. (PI)
;
Lucianovic, M. (PI)
;
Mazzeo, R. (PI)
;
Ohrt, C. (PI)
;
Taylor, C. (PI)
;
Wei, F. (PI)
;
Wieczorek, W. (PI)
;
Cant, D. (TA)
;
Fayyazuddin Ljungberg, B. (TA)
;
Love, J. (TA)
;
Wei, F. (TA)
MATH 51A: Linear Algebra, Multivariable Calculus, and Modern Applications, ACE
Students attend
MATH 51 lectures with different recitation sessions: three hours per week instead of two, emphasizing engineering applications. Prerequisite: application; see
https://web.stanford.edu/dept/soe/osa/ace.fb
Terms: Aut, Win, Spr

Units: 6

UG Reqs: GER:DBMath, WAYFR

Grading: Letter or Credit/No Credit
ME 300A: Linear Algebra with Application to Engineering Computations (CME 200)
Computer based solution of systems of algebraic equations obtained from engineering problems and eigensystem analysis, Gaussian elimination, effect of roundoff error, operation counts, banded matrices arising from discretization of differential equations, illconditioned matrices, matrix theory, least square solution of unsolvable systems, solution of nonlinear algebraic equations, eigenvalues and eigenvectors, similar matrices, unitary and Hermitian matrices, positive definiteness, CayleyHamilton theory and function of a matrix and iterative methods. Prerequisite: familiarity with computer programming, and
MATH51.
Terms: Aut

Units: 3

Grading: Letter or Credit/No Credit
Instructors:
Iaccarino, G. (PI)
;
Dibua, O. (TA)
;
Lyman, L. (TA)
...
more instructors for ME 300A »
Instructors:
Iaccarino, G. (PI)
;
Dibua, O. (TA)
;
Lyman, L. (TA)
;
Maher, G. (TA)
;
Tazhimbetov, N. (TA)
Filter Results: