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

21 - 30 of 161 results for: MATH

MATH 111: Computational Commutative Algebra

Introduction to the theory of commutative rings, ideals, and modules. Systems of polynomial equations in several variables from the algorithmic viewpoint. Groebner bases, Buchberger's algorithm, elimination theory. Applications to algebraic geometry and to geometric problems.
Terms: not given this year | Units: 3 | UG Reqs: GER:DB-Math | Grading: Letter or Credit/No Credit

MATH 113: Linear Algebra and Matrix Theory

Algebraic properties of matrices and their interpretation in geometric terms. The relationship between the algebraic and geometric points of view and matters fundamental to the study and solution of linear equations. Topics: linear equations, vector spaces, linear dependence, bases and coordinate systems; linear transformations and matrices; similarity; eigenvectors and eigenvalues; diagonalization.
Terms: Aut, Win, Spr | Units: 3 | UG Reqs: GER:DB-Math, WAY-FR | Grading: Letter or Credit/No Credit

MATH 114: Introduction to Scientific Computing (CME 108)

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.nImplementation of numerical methods in MATLAB programming assignments.nPrerequisites: MATH 51, 52, 53; prior programming experience (MATLAB or other language at level of CS 106A or higher).
Terms: Win, Sum | Units: 3-4 | Grading: Letter or Credit/No Credit

MATH 115: Functions of a Real Variable

The development of real analysis in Euclidean space: sequences and series, limits, continuous functions, derivatives, integrals. Basic point set topology. Honors math majors and students who intend to do graduate work in mathematics should take 171. Prerequisite: 51.
Terms: Aut, Spr | Units: 3 | UG Reqs: GER:DB-Math | Grading: Letter or Credit/No Credit

MATH 118: Mathematics of Computation

Notions of analysis and algorithms central to modern scientific computing: continuous and discrete Fourier expansions, the fast Fourier transform, orthogonal polynomials, interpolation, quadrature, numerical differentiation, analysis and discretization of initial-value and boundary-value ODE, finite and spectral elements. Prerequisites: MATH 51 and 53.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-Math | Grading: Letter or Credit/No Credit
Instructors: Ying, L. (PI)

MATH 120: Groups and Rings

Groups acting on sets, examples of finite groups, Sylow theorems, solvable and simple groups. Fields, rings, and ideals; polynomial rings over a field; PID and non-PID. Unique factorization domains. WIM.
Terms: Aut, Spr | Units: 3 | UG Reqs: GER:DB-Math, WAY-FR | Grading: Letter or Credit/No Credit

MATH 122: Modules and Group Representations

Modules over PID. Tensor algebra. Group representations and group rings. Maschke's theorem and character theory. Character tables, construction of representations. Prerequisite: Math 120. Also recommended: 113.
Terms: Spr | Units: 3 | Grading: Letter or Credit/No Credit

MATH 131P: Partial Differential Equations I

An introduction to PDE; particularly suitable for non-Math majors. Topics include physical examples of PDE's, method of characteristics, D'Alembert's formula, maximum principles, heat kernel, Duhamel's principle, separation of variables, Fourier series, Harmonic functions, Bessel functions, spherical harmonics. Students who have taken MATH 171 should consider taking MATH 173 rather than 131p. Prerequisite: 53.
Terms: Aut, Win | Units: 3 | UG Reqs: GER:DB-Math | Grading: Letter or Credit/No Credit

MATH 136: Stochastic Processes (STATS 219)

Introduction to measure theory, Lp spaces and Hilbert spaces. Random variables, expectation, conditional expectation, conditional distribution. Uniform integrability, almost sure and Lp convergence. Stochastic processes: definition, stationarity, sample path continuity. Examples: random walk, Markov chains, Gaussian processes, Poisson processes, Martingales. Construction and basic properties of Brownian motion. Prerequisite: STATS 116 or MATH 151 or equivalent. Recommended: MATH 115 or equivalent.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-Math | Grading: Letter or Credit/No Credit

MATH 155: Analytic Number Theory

Topics in analytic number theory such as the distribution of prime numbers, the prime number theorem, twin primes and Goldbach's conjecture, the theory of quadratic forms, Dirichlet's class number formula, Dirichlet's theorem on primes in arithmetic progressions, and the fifteen theorem. Prerequisite: 152, or familiarity with the Euclidean algorithm, congruences, residue classes and reduced residue classes, primitive roots, and quadratic reciprocity.
Terms: Spr | Units: 3 | UG Reqs: GER:DB-Math | 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