21 - 30 of 161 results for: MATH

Applications of the theory of groups. Topics: elements of group theory, groups of symmetries, matrix groups, group actions, and applications to combinatorics and computing. Applications: rotational symmetry groups, the study of the Platonic solids, crystallographic groups and their applications in chemistry and physics. WIM.

Number theory and its applications to modern cryptography. Topics: congruences, finite fields, primality testing and factorization, public key cryptography, error correcting codes, and elliptic curves, emphasizing algorithms. WIM.

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.

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.

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).

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.

Analytic functions, Cauchy integral formula, power series and Laurent series, calculus of residues and applications, conformal mapping, analytic continuation, introduction to Riemann surfaces, Fourier series and integrals. Prerequisites: 52, and 115 or 171.

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.

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.