On n-widths for elliptic problems
By Jens Markus Melenk. 2000
81 citations recorded by the source corpus.
Subfields: Applied Mathematics, Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/643fdda68181f59782aba27fd6eb3efafd7fb1b1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
In Computational Theory and Mathematics
- Anthony T. Patera
- Yvon Maday
- Annalisa Buffa
- Gabriel Turinici
- Christophe Prud'Homme
- Jens Markus Melenk
- Martin A. Grepl
- Thomas J. R. Hughes
In Numerical Analysis
- Anthony T. Patera
- Gabriel Turinici
- Yvon Maday
- Christophe Prud'Homme
- Annalisa Buffa
- Gianluigi Rozza
- Martin A. Grepl
- Bernhard Wieland
Citations in the corpus
- On Approximation in Meshless Methods (2005, background): “On the other hand, the constructions in [81] show that for reasonable classes of right-hand sides, it is in principle possible to construct good approximation spaces.”
- Optimal Local Multi-scale Basis Functions for Linear Elliptic Equations with Rough Coefficient (2015, unknown): “The compactness of T is demonstrated in [23, 8], and it was employed for elliptic equations with random input data recently in [19, 20] for stochastic model reduction.”
- A PRIORI CONVERGENCE OF THE GREEDY ALGORITHM FOR THE PARAMETRIZED REDUCED BASIS METHOD (2012, methodology): “These concepts have been used to analyze the effectiveness of hp-finite elements in [5].”