2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

11 - 15 of 15 results for: MATH51

MATH 51A: Linear Algebra, Multivariable Calculus, and Modern Applications, ACE

Students attend one of the regular MATH 51 lectures with a longer discussion section of four hours per week instead of two. Active mode: students in small groups discuss and work on problems from a worksheet distributed 2 or 3 days in advance, with a TA providing guidance and answering questions. Application required: https://forms.gle/ruykWBk6zJMgXRB49
Last offered: Spring 2022 | UG Reqs: GER:DB-Math, WAY-FR

MATH 51ACE: Linear Algebra, Multivariable Calculus, and Modern Applications, ACE

Additional problem solving session for Math 51 guided by a course assistant. Concurrent enrollment in Math 51 required. Application required: https://engineering.stanford.edu/students-academics/equity-and-inclusion-initiatives/undergraduate-programs/additional-calculus
Terms: Aut, Win, Spr | Units: 1

ME 300A: Linear Algebra with Application to Engineering Computations (CME 200)

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

MS&E 232H: Introduction to Game Theory (Accelerated)

Game theory uses mathematical models to study strategic interactions and situations of conflict and cooperation between rational decision-makers. This course provides an accelerated introduction to tools, models and computation in non-cooperative and cooperative game theory. Technical material includes normal and extensive form games, zero-sum games, Nash equilibrium and other solution concepts, repeated games, games with incomplete information, auctions and mechanism design, the core, and Shapley value. Exploration of applications of this material through playing stylized in-class and class-wide games and analyzing real-life applications. Prerequisites: mathematical maturity at the level of MATH51, and probability at the level of MS&E 120, or equivalent.
Terms: Win | Units: 3

STATS 229: Machine Learning (CS 229)

Topics: statistical pattern recognition, linear and non-linear regression, non-parametric methods, exponential family, GLMs, support vector machines, kernel methods, deep learning, model/feature selection, learning theory, ML advice, clustering, density estimation, EM, dimensionality reduction, ICA, PCA, reinforcement learning and adaptive control, Markov decision processes, approximate dynamic programming, and policy search. Prerequisites: knowledge of basic computer science principles and skills at a level sufficient to write a reasonably non-trivial computer program in Python/NumPy to the equivalency of CS106A, CS106B, or CS106X, familiarity with probability theory to the equivalency of CS 109, MATH151, or STATS 116, and familiarity with multivariable calculus and linear algebra to the equivalency of MATH51 or CS205.
Terms: Aut, Win, Sum | Units: 3-4
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints