Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods
 
research article

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Hesthaven, Jan S.  
•
Stamm, Benjamin
•
Zhang, Shun
2014
Mathematical Modelling and Numerical Analysis

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 devel- opment 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.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

M2AN482014.pdf

Type

Publisher's Version

cris-layout.advanced-attachment.oaire.version

http://purl.org/coar/version/c_970fb48d4fbd8a85

Access type

openaccess

Size

1.13 MB

Format

Adobe PDF

Checksum (MD5)

8cbb42a1eef3fb5365e72e8833539d5b

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés