Courses tagged with "Customer Service Certification Program" (283)

Prepare for the College Mathematics CLEP Exam through Education Portal's brief video lessons on mathematics. This course covers topics ranging from real number systems to probability and statistics. You'll learn to use the midpoint and distance formulas, graph inequalities and multiply binomials. You'll also explore the properties of various shapes and learn to determine their area and perimeter. Our lessons are taught by professional educators with experience in mathematics. In addition to designing the videos in this course, these educators have developed written transcripts and self-assessment quizzes to round out your learning experience.

This undergraduate level course follows Algebra I. Topics include group representations, rings, ideals, fields, polynomial rings, modules, factorization, integers in quadratic number fields, field extensions, and Galois theory.

Topics covered in a first year course in differential equations.

18.104 is an undergraduate level seminar for mathematics majors. Students present and discuss subject matter taken from current journals or books. Instruction and practice in written and oral communication is provided. The topics vary from year to year. The topic for this term is Applications to Number Theory.

This course is an introduction to the basics of random matrix theory, motivated by engineering and scientific applications.

This course analyzes combinatorial problems and methods for their solution. Topics include: enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms, and extremal combinatorics.

In this second term of Algebraic Topology, the topics covered include fibrations, homotopy groups, the Hurewicz theorem, vector bundles, characteristic classes, cobordism, and possible further topics at the discretion of the instructor.

This graduate-level course is a continuation of Mathematical Methods for Engineers I (18.085). Topics include numerical methods; initial-value problems; network flows; and optimization.

This course introduces students to iterative decoding algorithms and the codes to which they are applied, including Turbo Codes, Low-Density Parity-Check Codes, and Serially-Concatenated Codes. The course will begin with an introduction to the fundamental problems of Coding Theory and their mathematical formulations. This will be followed by a study of Belief Propagation--the probabilistic heuristic which underlies iterative decoding algorithms. Belief Propagation will then be applied to the decoding of Turbo, LDPC, and Serially-Concatenated codes. The technical portion of the course will conclude with a study of tools for explaining and predicting the behavior of iterative decoding algorithms, including EXIT charts and Density Evolution.

Lectures by P.B.Sunil Kumar, Department of Physics, IIT Madras

This course provides students with the basic analytical and computational tools of linear partial differential equations (PDEs) for practical applications in science engineering, including heat / diffusion, wave, and Poisson equations. Analytics emphasize the viewpoint of linear algebra and the analogy with finite matrix problems. Numerics focus on finite-difference and finite-element techniques to reduce PDEs to matrix problems. The Julia Language (a free, open-source environment) is introduced and used in homework for simple examples.

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 will focus on various aspects of mirror symmetry. It is aimed at students who already have some basic knowledge in symplectic and complex geometry (18.966, or equivalent). The geometric concepts needed to formulate various mathematical versions of mirror symmetry will be introduced along the way, in variable levels of detail and rigor.

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

This is an advanced interdisciplinary introduction to applied parallel computing on modern supercomputers. It has a hands-on emphasis on understanding the realities and myths of what is possible on the world's fastest machines. We will make prominent use of the Julia Language, a free, open-source, high-performance dynamic programming language for technical computing.

In this course on the mathematics of infinite random matrices, students will learn about the tools such as the Stieltjes transform and Free Probability used to characterize infinite random matrices.

Prepare for the College Mathematics CLEP Exam through Education Portal's brief video lessons on mathematics. This course covers topics ranging from real number systems to probability and statistics. You'll learn to use the midpoint and distance formulas, graph inequalities and multiply binomials. You'll also explore the properties of various shapes and learn to determine their area and perimeter. Our lessons are taught by professional educators with experience in mathematics. In addition to designing the videos in this course, these educators have developed written transcripts and self-assessment quizzes to round out your learning experience.

The goal of this course is to give an undergraduate-level introduction to representation theory (of groups, Lie algebras, and associative algebras). Representation theory is an area of mathematics which, roughly speaking, studies symmetry in linear spaces.

Analysis I (18.100) in its various versions covers fundamentals of mathematical analysis: continuity, differentiability, some form of the Riemann integral, sequences and series of numbers and functions, uniform convergence with applications to interchange of limit operations, some point-set topology, including some work in Euclidean n-space.

MIT students may choose to take one of three versions of 18.100: Option A (18.100A) chooses less abstract definitions and proofs, and gives applications where possible. Option B (18.100B) is more demanding and for students with more mathematical maturity; it places more emphasis from the beginning on point-set topology and n-space, whereas Option A is concerned primarily with analysis on the real line, saving for the last weeks work in 2-space (the plane) and its point-set topology. Option C (18.100C) is a 15-unit variant of Option B, with further instruction and practice in written and oral communication.

This course is organized around algorithmic issues that arise in machine learning. Modern machine learning systems are often built on top of algorithms that do not have provable guarantees, and it is the subject of debate when and why they work. In this class, we focus on designing algorithms whose performance we can rigorously analyze for fundamental machine learning problems.