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

Author： Hesthaven Jan S.   Stamm Benjamin   Zhang Shun  

Publisher： Edp Sciences

E-ISSN： 1290-3841|48|1|259-283

ISSN： 0764-583x

Source： ESAIM: Mathematical Modelling and Numerical Analysis, Vol.48, Iss.1, 2014-01, pp. : 259-283

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Double greedy algorithms: Reduced basis methods for transport dominated problems∗

By Dahmen Wolfgang   Plesken Christian   Welper Gerrit  

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 48, Iss. 3, 2014-01 ,pp. : 623-663

Edp Sciences

Access to resources Recommend Favorite

Greedy algorithms for high-dimensional non-symmetric linear problems***

By  

ESAIM: Proceedings, Vol. 41, Iss. issue, 2013-12 ,pp. : 95-131

Edp Sciences

Access to resources Recommend Favorite

A priori convergence of the Greedy algorithm for the parametrized reduced basis method

By Buffa Annalisa   Maday Yvon   Patera Anthony T.   Prud’homme Christophe   Turinici Gabriel  

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 46, Iss. 3, 2012-01 ,pp. : 595-603

Edp Sciences

Access to resources Recommend Favorite

Efficient Solution of Ordinary Differential Equations with High-Dimensional Parametrized Uncertainty

By  

Communications in Computational Physics, Vol. 10, Iss. 2, 2011-08 ,pp. : 253-278

Cambridge University Press

Access to resources Recommend Favorite

Spectral interpolation in non-orthogonal domains: algorithms and applications

By Karniadakis George   Hesthaven Jan  

Journal of Engineering Mathematics, Vol. 56, Iss. 3, 2006-11 ,pp. : 201-202

Springer Publishing Company

Access to resources Recommend Favorite