Sampling theory

Friday, September 9, 2011 - 11:30am - 12:10pm
Bjorn Engquist (The University of Texas at Austin)
Simulations of multiscale solutions to differential equations often require a reduction in the number of unknowns compared to those in a standard discretization. This is in order to limit the memory requirement and the computational complexity. We will discuss common reduction techniques based on mesh refinements in the light of classical and novel sampling theorems from information theory.
Subscribe to RSS - Sampling theory