This course provides an introduction to algorithms. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow;...

This course, presented by MIT and taught by Professor Alar Toomre, provides an introduction to numerical analysis. The material looks at the basic techniques for the efficient numerical solution of problems in science...

Created by David Smith for the Connected Curriculum Project, the purpose of this module is to explore the properties of inverse matrices. Our principal tool for this exploration is the expression of elementary row...

Created by Lang Moore and David Smith for the Connected Curriculum Project, the purposes of this module are to experiment with Taylor and Laurent series commands in a computer algebra system and to explore the behavior...

Created by David Smith for the Connected Curriculum Project, the purpose of this module is to develop the concept of fitting a least squares line from the concept of orthogonal projection of a vector on a subspace. This...