#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2005

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- M. Fares, Jan S. Hesthaven, Yvon Maday, Benjamin Stamm
- J. Comput. Physics
- 2011

We introduce the Reduced Basis Method (RBM) as an efficient tool for parametrized scattering problems in computational electromagnetics for problems where field solutions are computed using a standard Boundary Element Method (BEM) for the parametrized Electric Field Integral Equation (EFIE). This combination enables an algorithmic cooperation which results… (More)

- Benjamin Stamm, Thomas P. Wihler
- Math. Comput.
- 2010

The aim of this paper is to present and analyze a class of hp-version discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic problems. This class includes a number of well-known DG formulations. We will show that the methods are stable provided that the stability parameters are suitably chosen. Furthermore, on… (More)

- Erik Burman, Benjamin Stamm
- SIAM J. Numerical Analysis
- 2008

We consider DG-methods for 2nd order scalar elliptic problems using piecewise affine approximation in two or three space dimensions. We prove that both the symmetric and the non-symmetric version of the DG-method are well-posed also without penalization of the interelement solution jumps provided boundary conditions are imposed weakly. Optimal convergence… (More)

- Erik Burman, Benjamin Stamm
- J. Sci. Comput.
- 2007

We consider a discontinuous Galerkin finite element method for the advection–reaction equation in two space–dimensions. For polynomial approximation spaces of degree greater than or equal to two on triangles we propose a method where stability is obtained by a penalization of only the upper portion of the polynomial spectrum of the jump of the solution over… (More)

- Yvon Maday, Benjamin Stamm
- SIAM J. Scientific Computing
- 2013

Reduced order models, in particular the reduced basis method, rely on empirically built and problem dependent basis functions that are constructed during an off-line stage. In the on-line stage, the precomputed problem-dependent solution space, that is spanned by the basis functions, can then be used in order to reduce the size of the computational problem.… (More)

We propose two new algorithms to improve 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… (More)

- Erik Burman, Benjamin Stamm
- Numerische Mathematik
- 2010

We extend the results on minimal stabilization of Burman and Stamm (" Minimal stabilization of discontinuous Galerkin finite element methods for hyperbolic problems " , to the case of the local discontinuous Galerkin methods on mixed form. The penalization term on the faces is relaxed to act only on a part of the polynomial spectrum. Stability in the form… (More)

- Eric Cancès, Yvon Maday, Benjamin Stamm
- The Journal of chemical physics
- 2013

This article is the first of a series of papers dealing with domain decomposition algorithms for implicit solvent models. We show that, in the framework of the COSMO model, with van der Waals molecular cavities and classical charge distributions, the electrostatic energy contribution to the solvation energy, usually computed by solving an integral equation… (More)

- Filippo Lipparini, Benjamin Stamm, Eric Cancès, Yvon Maday, Benedetta Mennucci
- Journal of chemical theory and computation
- 2013

In this contribution, an efficient, parallel, linear scaling implementation of the conductor-like screening model (COSMO) is presented, following the domain decomposition (dd) algorithm recently proposed by three of us. The implementation is detailed and its linear scaling properties, both in computational cost and memory requirements, are demonstrated.… (More)