Network Flows and Combinatorics: Max Flow = Min Cut
By Gilbert Strang - MIT
-
1,819
- Report An Inaccuracy In Lecture Information:
Lecture Description
Course Description
This course provides a review of linear algebra, including applications to networks, structures, and estimation, Lagrange multipliers. Also covered are: differential equations of equilibrium; Laplace's equation and potential flow; boundary-value problems; minimum principles and calculus of variations; Fourier series; discrete Fourier transform; convolution; and applications.
Course Index
Show:
