Online courses directory (418)

This is a variation on 18.02 Multivariable Calculus. It covers the same topics as in 18.02, but with more focus on mathematical concepts.

Acknowledgement

Prof. McKernan would like to acknowledge the contributions of Lars Hesselholt to the development of this course.

This is an undergraduate course on differential calculus in one and several dimensions. It is intended as a one and a half term course in calculus for students who have studied calculus in high school. The format allows it to be entirely self contained, so that it is possible to follow it without any background in calculus.

This course covers matrix theory and linear algebra, emphasizing topics useful in other disciplines such as physics, economics and social sciences, natural sciences, and engineering. It parallels the combination of theory and applications in Professor Strang’s textbook Introduction to Linear Algebra.

Course Format

This course has been designed for independent study. It provides everything you will need to understand the concepts covered in the course. The materials include:

• A complete set of Lecture Videos by Professor Gilbert Strang.
• Summary Notes for all videos along with suggested readings in Prof. Strang's textbook Linear Algebra.
• Problem Solving Videos on every topic taught by an experienced MIT Recitation Instructor.
• Problem Sets to do on your own with Solutions to check your answers against when you're done.
• A selection of Java® Demonstrations to illustrate key concepts.
• A full set of Exams with Solutions, including review material to help you prepare.

This course continues the content covered in 18.100 Analysis I. Roughly half of the subject is devoted to the theory of the Lebesgue integral with applications to probability, and the other half to Fourier series and Fourier integrals.

This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds:

1. Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations.
2. Discrete structures: graphs, state machines, modular arithmetic, counting.
3. Discrete probability theory.

On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.

Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.

This course analyzes the functions of a complex variable and the calculus of residues. It also covers subjects such as ordinary differential equations, partial differential equations, Bessel and Legendre functions, and the Sturm-Liouville theory.

This graduate level course focuses on nonlinear dynamics with applications. It takes an intuitive approach with emphasis on geometric thinking, computational and analytical methods and makes extensive use of demonstration software.

This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.

Game Theory, also known as Multiperson Decision Theory, is the analysis of situations in which the payoff of a decision maker depends not only on his own actions but also on those of others. Game Theory has applications in several fields, such as economics, politics, law, biology, and computer science. In this course, I will introduce the basic tools of game theoretic analysis. In the process, I will outline some of the many applications of Game Theory, primarily in economics.

In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.

The main goal of this course is to study the generalization ability of a number of popular machine learning algorithms such as boosting, support vector machines and neural networks. Topics include Vapnik-Chervonenkis theory, concentration inequalities in product spaces, and other elements of empirical process theory.

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 offers an introduction to discrete and computational geometry. Emphasis is placed on teaching methods in combinatorial geometry. Many results presented are recent, and include open (as yet unsolved) problems.

This course provides an elementary introduction to probability and statistics with applications. Topics include: basic combinatorics, random variables, probability distributions, Bayesian inference, hypothesis testing, confidence intervals, and linear regression.

The Spring 2014 version of this subject employed the residential MITx system, which enables on-campus subjects to provide MIT students with learning and assessment tools such as online problem sets, lecture videos, reading questions, pre-lecture questions, problem set assistance, tutorial videos, exam review content, and even online exams.

This course provides a graduate-level introduction to stellar astrophysics. It covers a variety of topics, ranging from stellar structure and evolution to galactic dynamics and dark matter.

Combinatorial Optimization provides a thorough treatment of linear programming and combinatorial optimization. Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems.

This course is a first course in algebraic topology. The emphasis is on homology and cohomology theory, including cup products, Kunneth formulas, intersection pairings, and the Lefschetz fixed point theorem.

This course covers topics such as sums of independent random variables, central limit phenomena, infinitely divisible laws, Levy processes, Brownian motion, conditioning, and martingales.

This course offers a rigorous treatment of linear algebra, including vector spaces, systems of linear equations, bases, linear independence, matrices, determinants, eigenvalues, inner products, quadratic forms, and canonical forms of matrices. Compared with 18.06 Linear Algebra, more emphasis is placed on theory and proofs.