|
Abstract:
We propose two new and enhanced algorithms for greedy sampling of high-dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the development of reduced basis techniques for high-dimensional parametrized functions. The first algorithm, based on a assumption of saturation of error in the greedy algorithm, is shown to result in a significant reduction of the workload over the standard greedy algorithm. In an improved approach, this is combined with an algorithm in which the train set for the greedy approach is adaptively sparsefied and enriched. A safety check step is added at the end of the algorithm to certify the quality of the basis set. Both these techniques are applicable to high-dimensional problems and we shall demonstrate their performance on a number of numerical examples.
| Limitations: |
 APPROVED FOR PUBLIC RELEASE |
| Description: |
Technical rept. |
| Pages: |
24 |
| Report Date: |
09 Sep 2011 |
| Contract Number: |
FA9550-09-1-0613 |
| Report Number: |
A431455 |
|
|
|
|
|
Keywords relating to this report:
Email This Abstract
