Abstract
Is Greedy Good?
Ronald DeVore
Texas A&M University - College Station
Greedy algorithms are a common staple in numerical computation and signal processing. We will examine a greedy algorithm used in the reduced basis method for solving a family of parametric or stochastic PDEs. Our interest is a priori estimates for how well this algorithm will perform.
No video available