Online courses directory (418)

This course aims to give students the tools and training to recognize convex optimization problems that arise in scientific and engineering applications, presenting the basic theory, and concentrating on modeling aspects and results that are useful in applications. Topics include convex sets, convex functions, optimization problems, least-squares, linear and quadratic programs, semidefinite programming, optimality conditions, and duality theory. Applications to signal processing, control, machine learning, finance, digital and analog circuit design, computational geometry, statistics, and mechanical engineering are presented. Students complete hands-on exercises using high-level numerical software.

Acknowledgements

The course materials were developed jointly by Prof. Stephen Boyd (Stanford), who was a visiting professor at MIT when this course was taught, and Prof. Lieven Vanderberghe (UCLA).

Types of Decay. Half-Life. Exponential Decay Formula Proof (can skip, involves Calculus). Introduction to Exponential Decay. More Exponential Decay Examples. Types of Decay. Half-Life. Exponential Decay Formula Proof (can skip, involves Calculus). Introduction to Exponential Decay. More Exponential Decay Examples.

This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. Part I covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.

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 teaches the art of guessing results and solving problems without doing a proof or an exact calculation. Techniques include extreme-cases reasoning, dimensional analysis, successive approximation, discretization, generalization, and pictorial analysis. Applications include mental calculation, solid geometry, musical intervals, logarithms, integration, infinite series, solitaire, and differential equations. (No epsilons or deltas are harmed by taking this course.) This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can recognize as true even though they don't follow from the system of axioms. In my opinion, which is widely shared, this is the most important single result in the entire history of logic, important not only on its own right but for the many applications of the technique by which it's proved. We'll discuss some of these applications, among them: Church's theorem that there is no algorithm for deciding when a formula is valid in the predicate calculus; Tarski's theorem that the set of true sentence of a language isn't definable within that language; and Gödel's second incompleteness theorem, which says that no consistent system of axioms can prove its own consistency.

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.

An introduction to dynamical modeling techniques used in contemporary Systems Biology research.

Learn about General Game Playing (GGP) and develop GGP programs capable of competing against humans and other programs in GGP competitions .

In this class you will look behind the scenes of image and video processing, from the basic and classical tools to the most modern and advanced algorithms.

This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

Principles of Applied Mathematics is a study of illustrative topics in discrete applied mathematics including sorting algorithms, information theory, coding theory, secret codes, generating functions, linear programming, game theory. There is an emphasis on topics that have direct application in the real world.

This course was recently revised to meet the MIT Undergraduate Communication Requirement (CR). It covers the same content as 18.310, but assignments are structured with an additional focus on writing.

The laws of nature are expressed as differential equations. Scientists and engineers must know how to model the world in terms of differential equations, and how to solve those equations and interpret the solutions. This course focuses on the equations and techniques most useful in science and engineering.

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:

• Lecture Videos by Professor Arthur Mattuck.
• Course Notes on every topic.
• Practice Problems with Solutions.
• Problem Solving Videos taught by experienced MIT Recitation Instructors.
• Problem Sets to do on your own with Solutions to check your answers against when you're done.
• A selection of Interactive Java® Demonstrations called Mathlets to illustrate key concepts.
• A full set of Exams with Solutions, including practice exams to help you prepare.

Content Development

In this course, you will learn how to formalize information and reason systematically to produce logical conclusions. We will also examine logic technology and its applications - in mathematics, science, engineering, business, law, and so forth.

Learn how to think the way mathematicians do - a powerful cognitive process developed over thousands of years.

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.

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.

We are surrounded by information, much of it numerical, and it is important to know how to make sense of it. Stat2x is an introduction to the fundamental concepts and methods of statistics, the science of drawing conclusions from data.

The course is the online equivalent of Statistics 2, a 15-week introductory course taken in Berkeley by about 1,000 students each year. Stat2x is divided into three 5-week components. Stat2.1x is the first of the three.

The focus of Stat2.1x is on descriptive statistics. The goal of descriptive statistics is to summarize and present numerical information in a manner that is illuminating and useful. The course will cover graphical as well as numerical summaries of data, starting with a single variable and progressing to the relation between two variables. Methods will be illustrated with data from a variety of areas in the sciences and humanities.

There will be no mindless memorization of formulas and methods. Throughout Stat2.1x, the emphasis will be on understanding the reasoning behind the calculations, the assumptions under which they are valid, and the correct interpretation of results.

FAQ

• What is the format of the class?
  • Instruction will be consist of brief lectures and exercises to check comprehension. Grades (Pass or Not Pass) will be decided based on a combination of scores on short assignments, quizzes, and a final exam.
• How much does it cost to take the course?
  • Nothing! The course is free.
• Will the text of the lectures be available?
  • Yes. All of our lectures will have transcripts synced to the videos.
• Do I need to watch the lectures live?
  • No. You can watch the lectures at your leisure.
• Can I contact the Instructor or Teaching Assistants?
  • Yes, but not directly. The discussion forums are the appropriate venue for questions about the course. The instructors will monitor the discussion forums and try to respond to the most important questions; in many cases response from other students and peers will be adequate and faster.
• Do I need any other materials to take the course?
  • If you have any questions about edX generally, please see the edX FAQ.

Topics covered in a first year course in differential equations. Need to understand basic differentiation and integration from Calculus playlist before starting here. What is a differential equation. Separable Differential Equations. Separable differential equations 2. Exact Equations Intuition 1 (proofy). Exact Equations Intuition 2 (proofy). Exact Equations Example 1. Exact Equations Example 2. Exact Equations Example 3. Integrating factors 1. Integrating factors 2. First order homegenous equations. First order homogeneous equations 2. 2nd Order Linear Homogeneous Differential Equations 1. 2nd Order Linear Homogeneous Differential Equations 2. 2nd Order Linear Homogeneous Differential Equations 3. 2nd Order Linear Homogeneous Differential Equations 4. Complex roots of the characteristic equations 1. Complex roots of the characteristic equations 2. Complex roots of the characteristic equations 3. Repeated roots of the characteristic equation. Repeated roots of the characteristic equations part 2. Undetermined Coefficients 1. Undetermined Coefficients 2. Undetermined Coefficients 3. Undetermined Coefficients 4. Laplace Transform 1. Laplace Transform 2. Laplace Transform 3 (L{sin(at)}). Laplace Transform 4. Laplace Transform 5. Laplace Transform 6. Laplace Transform to solve an equation. Laplace Transform solves an equation 2. More Laplace Transform tools. Using the Laplace Transform to solve a nonhomogeneous eq. Laplace Transform of : L{t}. Laplace Transform of t^n: L{t^n}. Laplace Transform of the Unit Step Function. Inverse Laplace Examples. Laplace/Step Function Differential Equation. Dirac Delta Function. Laplace Transform of the Dirac Delta Function. Introduction to the Convolution. The Convolution and the Laplace Transform. Using the Convolution Theorem to Solve an Initial Value Prob.