Publication

A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods

Publications associées (44)

Discontinuous Galerkin finite element heterogeneous multiscale method for elliptic problems with multiple scales

An analysis of a multiscale symmetric interior penalty discontinuous Galerkin finite element method for the numerical discretization of elliptic problems with multiple scales is proposed. This new method, first described in [A. Abdulle, C.R. Acad. Sci. Par ...

2012

Quotient-method Algorithms for Input-affine Single-input Nonlinear Systems

Willson Sudarsandhari Shibani

Many real-world systems are intrinsically nonlinear. This thesis proposes various algorithms for designing control laws for input-affine single-input nonlinear systems. These algorithms, which are based on the concept of quotients used in nonlinear control ...

EPFL2012

A coupled distinct lattice spring model for rock failure under dynamic loads

Jiannong Fang, Jian Zhao, Gaofeng Zhao

It is necessary to take into account the micro discretization of natural rock when studying its macroscopic failure behavior. This requirement has resulted in renewed and increased interest in the discrete or framework/lattice numerical modeling techniques ...

Elsevier2012

Integrating computational methods to retrofit enzymes to synthetic pathways

Ursula Röthlisberger, Vassily Hatzimanikatis, Ivano Tavernelli, Elizabeth Claire Brunk, Marilisa Neri

Microbial production of desired compounds provides an efficient framework for the development of renewable energy resources. To be competitive to traditional chemistry, one requirement is to utilize the full capacity of the microorganism to produce target ...

Wiley-Blackwell2012

Challenges in Computational Electromagnetics

Ruzica Golubovic

To meet strict requirements of the information society technologies, antennas and circuit elements are becoming increasingly complex. Frequently, their electromagnetic (EM) properties cannot be anymore expressed in closed-form analytical expressions mainly ...

EPFL2011

Model Order Reduction by geometrical parametrization for shape optimization in computational fluid dynamics

Gianluigi Rozza, Andrea Manzoni

Shape Optimization problems governed by partial differential equations result from many applications in computational fluid dynamics; they involve the repetitive evaluation of outputs expressed as functionals of the field variables and usually imply big co ...

2010

High-Order Discontinuous Galerkin Methods for Computational Electromagnetics and Uncertainty Quantification

Jan Sickmann Hesthaven

We discuss the basics of discontinuous Galerkin methods (DG) for CEM as an alternative of emerging importance to the widely used FDTD. The benefits of DG methods include geometric flexibility, high-order accuracy, explicit timeadvancement, and very high pa ...

Springer2010

Reduced Basis method for parametrized elliptic advection-reaction problems

Luca Dede'

In this work we consider the Reduced Basis method for the solution of parametrized advection-reaction partial differential equations. For the generation of the basis we adopt a stabilized finite element method and we define the Reduced Basis method in the ...

2010

A branch and bound algorithm for disassembly scheduling with assembly product structure⋆

Paul Xirouchakis, Hwa-Joong Kim

This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the demand of their parts or components over a planning hor ...

2009

Filtering in Legendre spectral methods

Jan Sickmann Hesthaven

We discuss the impact of modal filtering in Legendre spectral methods, both on accuracy and stability. For the former, we derive sufficient conditions on the filter to recover high order accuracy away from points of discontinuity. Computational results con ...

American Mathematical Society2008

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search