Classical theory of ordinary differential equations and some of its modern developments in dynamical systems theory. Linear systems and exponential matrix solutions. Well-posedness for nonlinear systems. Qualitative theory: limit sets, invariant set and manifolds. Stability theory: linearization about an equilibrium, Lyapunov functions. Autonomous two-dimensional systems and other special systems. Prerequisites: advanced calculus, linear algebra and basic ODE.

General theory of measure and integration and its specialization to Euclidean spaces and Lebesgue measure; modes of convergence, Lp spaces, product spaces, differentiation of measures and functions, signed measures, Radon-Nikodym theorem.

Introduction to groups, rings, and fields. Direct sums and products of groups, cosets, Lagrange's theorem, normal subgroups, quotient groups. Polynomial rings, UFDs and PIDs, division rings. Fields of fractions, GCD and LCM, irreducibility criteria for polynomials. Prime field, characteristic, field extension, finite fields. Some topics from Math 612 included.

A modern treatment of probability theory based on abstract measure and integration. Random variables, expectations, independence, laws of large numbers, central limit theorem, and general conditioning using the Radon-Nikodym theorem. Introduction to stochastic processes: martingales, Brownian motion.

Not available at this time

This course will provide an introduction to machine learning from a mathematical perspective. The primary objective of this course is to cultivate in students a sense of mathematical curiosity and equip them with the skills to ask mathematical questions when studying machine learning algorithms. Classical supervised learning methods will be presented and studied using the tools from information theory, statistical learning theory, optimization, and basic functional analysis.

Introduction to computational techniques used in science and industry. Topics selected from root-finding, interpolation, data fitting, linear systems, numerical integration, numerical solution of differential equations, and error analysis. Prerequisites: MATH 233 and 235, or consent of instructor, and knowledge of a scientific programming language.

Introduction to computational techniques used in science and industry. Topics selected from root-finding, interpolation, data fitting, linear systems, numerical integration, numerical solution of differential equations, and error analysis. Prerequisites: MATH 233 and 235, or consent of instructor, and knowledge of a scientific programming language.

Introduction to computational techniques used in science and industry. Topics selected from root-finding, interpolation, data fitting, linear systems, numerical integration, numerical solution of differential equations, and error analysis. Prerequisites: MATH 233 and 235, or consent of instructor, and knowledge of a scientific programming language.

Basic concepts (over real or complex numbers): vector spaces, basis, dimension, linear transformations and matrices, change of basis, similarity. Study of a single linear operator: minimal and characteristic polynomial, eigenvalues, invariant subspaces, triangular form, Cayley-Hamilton theorem. Inner product spaces and special types of linear operators (over real or complex fields): orthogonal, unitary, self-adjoint, hermitian. Diagonalization of symmetric matrices, applications.