Courses tagged with "Information environments" (59)
Double affine Hecke algebras (DAHA), also called Cherednik algebras, and their representations appear in many contexts: integrable systems (Calogero-Moser and Ruijsenaars models), algebraic geometry (Hilbert schemes), orthogonal polynomials, Lie theory, quantum groups, etc. In this course we will review the basic theory of DAHA and their representations, emphasizing their connections with other subjects and open problems.
This is a second-semester graduate course on the geometry of manifolds. The main emphasis is on the geometry of symplectic manifolds, but the material also includes long digressions into complex geometry and the geometry of 4-manifolds, with special emphasis on topological considerations.
The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.
This course emphasizes concepts and techniques for solving integral equations from an applied mathematics perspective. Material is selected from the following topics: Volterra and Fredholm equations, Fredholm theory, the Hilbert-Schmidt theorem; Wiener-Hopf Method; Wiener-Hopf Method and partial differential equations; the Hilbert Problem and singular integral equations of Cauchy type; inverse scattering transform; and group theory. Examples are taken from fluid and solid mechanics, acoustics, quantum mechanics, and other applications.
This course introduces the basic computational methods used to understand the cell on a molecular level. It covers subjects such as the sequence alignment algorithms: dynamic programming, hashing, suffix trees, and Gibbs sampling. Furthermore, it focuses on computational approaches to: genetic and physical mapping; genome sequencing, assembly, and annotation; RNA expression and secondary structure; protein structure and folding; and molecular interactions and dynamics.
This course is devoted to the theory of Lie Groups with emphasis on its connections with Differential Geometry. The text for this class is Differential Geometry, Lie Groups and Symmetric Spaces by Sigurdur Helgason (American Mathematical Society, 2001).
Much of the course material is based on Chapter I (first half) and Chapter II of the text. The text however develops basic Riemannian Geometry, Complex Manifolds, as well as a detailed theory of Semisimple Lie Groups and Symmetric Spaces.
This course is an introduction to linear optimization and its extensions emphasizing the underlying mathematical structures, geometrical ideas, algorithms and solutions of practical problems. The topics covered include: formulations, the geometry of linear optimization, duality theory, the simplex method, sensitivity analysis, robust optimization, large scale optimization network flows, solving problems with an exponential number of constraints and the ellipsoid method, interior point methods, semidefinite optimization, solving real world problems problems with computer software, discrete optimization formulations and algorithms.
This course offers an advanced introduction to numerical linear algebra. Topics include direct and iterative methods for linear systems, eigenvalue decompositions and QR/SVD factorizations, stability and accuracy of numerical algorithms, the IEEE floating point standard, sparse and structured matrices, preconditioning, linear algebra software. Problem sets require some knowledge of MATLAB®.
This course offers an advanced introduction to numerical linear algebra. Topics include direct and iterative methods for linear systems, eigenvalue decompositions and QR/SVD factorizations, stability and accuracy of numerical algorithms, the IEEE floating point standard, sparse and structured matrices, preconditioning, linear algebra software. Problem sets require some knowledge of MATLAB®.
Find out what solid-state physics has brought to Electromagnetism in the last 20 years. This course surveys the physics and mathematics of nanophotonics—electromagnetic waves in media structured on the scale of the wavelength.
Topics include computational methods combined with high-level algebraic techniques borrowed from solid-state quantum mechanics: linear algebra and eigensystems, group theory, Bloch's theorem and conservation laws, perturbation methods, and coupled-mode theories, to understand surprising optical phenomena from band gaps to slow light to nonlinear filters.
Note: An earlier version of this course was published on OCW as 18.325 Topics in Applied Mathematics: Mathematical Methods in Nanophotonics, Fall 2005.
This graduate level mathematics course covers decision theory, estimation, confidence intervals, and hypothesis testing. The course also introduces students to large sample theory. Other topics covered include asymptotic efficiency of estimates, exponential families, and sequential analysis.
This is the first semester of a one year graduate course in number theory covering standard topics in algebraic and analytic number theory. At various points in the course, we will make reference to material from other branches of mathematics, including topology, complex analysis, representation theory, and algebraic geometry.
Numerical methods for solving problems arising in heat and mass transfer, fluid mechanics, chemical reaction engineering, and molecular simulation. Topics: numerical linear algebra, solution of nonlinear algebraic equations and ordinary differential equations, solution of partial differential equations (e.g. Navier-Stokes), numerical methods in molecular simulation (dynamics, geometry optimization). All methods are presented within the context of chemical engineering problems. Familiarity with structured programming is assumed. The examples will use MATLAB®.
Acknowledgements
The instructor would like to thank Robert Ashcraft, Sandeep Sharma, David Weingeist, and Nikolay Zaborenko for their work in preparing materials for this course site.
Trusted paper writing service WriteMyPaper.Today will write the papers of any difficulty.