Unit 7 · Linear Transformations and Applications

Chapter 7.3

Linear Programming and Computation

The course's applied tail: optimizing over a polytope of constraints, and what linear algebra looks like when the matrices are huge and the arithmetic is floating-point.

12–16 min · in preparation · lesson 21 of 21

By the end

  1. 01Set up linear programs and describe the simplex idea geometrically
  2. 02Name the core concerns of numerical linear algebra: cost, stability, sparsity
  3. 03Survey where large-scale computation meets the course's factorizations

In unit 7

  1. 7.1Complex Matrices, Fourier, and the FFT12–16
  2. 7.2Linear Transformations and Choice of Basis12–16
  3. 7.3Linear Programming and Computation12–16
RELUE© MMXXVI

AP® is a registered trademark of the College Board, which was not involved in the production of, and does not endorse, this content.