MATH 6250

MATH 6250

Course information provided by the 2026-2027 Catalog.

A high-level survey course on ten influential algorithms that shaped modern computational science and optimization. Each week focuses on a single algorithm - such as the Metropolis algorithm, simplex method, conjugate gradient, QR factorization, fast Fourier transform, fast multipole method - covering the historical context, key mathematical ideas, and modern applications. Students must have a background in linear algebra, calculus, and basic analysis.


Prerequisites background equivalent to: MATH 2210 or MATH 2230 or MATH 2310 or MATH 2940; MATH 2220 or MATH 2240 or MATH 1920; MATH 3110.

Last 4 Terms Offered (None)

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 16160 MATH 6250   LEC 001

    • MW
    • Jan 25 - May 11, 2027
    • Townsend, A

  • Instruction Mode: In Person