2014-2015 2015-2016 2016-2017 2017-2018 2018-2019
Browse
by subject...
    Schedule
view...
 

141 - 150 of 161 results for: MATH

MATH 286: Topics in Differential Geometry

May be repeated for credit.
Terms: Win, Spr | Units: 3 | Repeatable for credit | Grading: Letter or Credit/No Credit

MATH 287: Introduction to optimal transportation

This will be an introductory course on Optimal Transportation theory. We will study Monge's problem, Kantorovich's problem, c-concave functions (also in the Riemannian setting), Wasserstein distance and geodesics (including a PDE formulation), applications to inequalities in convex analysis, as well as other topics, time permitting.
Terms: not given this year | Units: 3 | Grading: Letter or Credit/No Credit

MATH 290B: Model Theory B (PHIL 350B)

Decidable theories. Model-theoretic background. Dense linear orders, arithmetic of addition, real closed and algebraically closed fields, o-minimal theories.
Terms: Aut | Units: 1-3 | Repeatable for credit | Grading: Letter or Credit/No Credit
Instructors: Mints, G. (PI)

MATH 292A: Set Theory (PHIL 352A)

The basics of axiomatic set theory; the systems of Zermelo-Fraenkel and Bernays-Gödel. Topics: cardinal and ordinal numbers, the cumulative hierarchy and the role of the axiom of choice. Models of set theory, including the constructible sets and models constructed by the method of forcing. Consistency and independence results for the axiom of choice, the continuum hypothesis, and other unsettled mathematical and set-theoretical problems. Prerequisites: PHIL151 and MATH 161, or equivalents.
Terms: not given this year | Units: 3 | Grading: Letter or Credit/No Credit

MATH 293A: Proof Theory (PHIL 353A)

Gentzen's natural deduction and sequential calculi for first-order propositional and predicate logics. Normalization and cut-elimination procedures. Relationships with computational lambda calculi and automated deduction. Prerequisites: 151, 152, and 161, or equivalents.
Terms: not given this year | Units: 3 | Grading: Letter or Credit/No Credit

MATH 295: Computation and Algorithms in Mathematics

Use of computer and algorithmic techniques in various areas of mathematics. Computational experiments. Topics may include polynomial manipulation, Groebner bases, computational geometry, and randomness. May be repeated for credit.
Terms: not given this year | Units: 3 | Repeatable for credit | Grading: Letter or Credit/No Credit

MATH 301: Advanced Topics in Convex Optimization

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: not given this year | Units: 3 | Repeatable for credit | Grading: Letter or Credit/No Credit

MATH 310: Top Ten Algorithms of the 20th Century (CME 329)

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.
Terms: Aut | Units: 3 | Grading: Letter or Credit/No Credit

MATH 355: Graduate Teaching Seminar

Required of and limited to first-year Mathematics graduate students.
Terms: Spr | Units: 1 | Grading: Satisfactory/No Credit

MATH 360: Advanced Reading and Research

Terms: Aut, Win, Spr, Sum | Units: 1-10 | Repeatable for credit | Grading: Letter or Credit/No Credit
Filter Results:
term offered
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