Course Websites

CS 598 APK - Fast Algorithms & Intrgl Equat

Last offered Fall 2022

Official Description

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: May be repeated in the same or separate terms if topics vary.

Section Description

Near-linear-complexity ("fast") numerical algorithms and related numerical methods, mainly for the numerical solution of elliptic partial differential equations, such as Laplace, Helmholtz, Stokes, Maxwell's, or elasticity. Numerical rank, complexity/accuracy trade-offs, notions of convergence. Multi-level compression schemes. Tree codes, Fast Multipole Methods. Potential Theory and Integral Equations. Quadrature. Fast, compression-based, linear-time direct solvers based, randomized linear algebra. Fast function transforms: Uniform and non-uniform FFTs, Butterfly algorithms. For up-to-date information about CS course restrictions, please see the following link:

Related Faculty

Fast Algorithms & Intrgl EquatAPK64616S741400 - 1515 W F  305 Materials Science & Eng Bld Andreas Paul Eberhard Kloeckner