Concept

Anneau de Dedekind

Publications associées (36)

INTERNODES: an accurate interpolation-based method for coupling the Galerkin solutions of PDEs on subdomains featuring non-conforming interfaces

Alfio Quarteroni, Simone Deparis, Davide Forti

We are interested in the approximation of partial differential equations on domains decomposed into two (or several) subdomains featuring non-conforming interfaces. The non-conformity may be due to different meshes and/or different polynomial degrees used ...

Elsevier2016

Flux de (micro)-plastiques dans le bassin versant du Léman

Olivier Pompini

Everywhere around the world, a huge amount of plastics is being produced, used and treated every day. A certain amount of these plastics are badly managed and end up in the environment, where they can be problematic. The deplorable state of the ocean as we ...

2016

Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to ...

Elsevier2016

Nodal discontinuous Galerkin methods for fractional diffusion equations on 2D domain with triangular meshes

Jan Sickmann Hesthaven

This paper, as the sequel to previous work, develops numerical schemes for fractional diffusion equations on a two-dimensional finite domain with tri- angular meshes. We adopt the nodal discontinuous Galerkin methods for the full spatial discretization by ...

Elsevier2015

MATHICSE Technical Report : INTERNODES: an accurate interpolation-based method for coupling the Galerkin solutations of PDEs on subdomains featuring non-conforming interfaces

Alfio Quarteroni, Simone Deparis, Davide Forti

MATHICSE2015

MATHICSE Technical Report: Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

MATHICSE2015

Decomposition and tractability in qualitative spatial and temporal reasoning

Jingshi Li

Constraint networks in qualitative spatial and temporal reasoning (QSTR) typically feature variables defined on infinite domains. Mainstream algorithms for deciding network consistency are based on searching for network refinements whose consistency is kno ...

Elsevier2013

Identification of MAGI1 as a tumor-suppressor protein induced by cyclooxygenase-2 inhibitors in colorectal cancer cells

Cyclooxyganase-2 (COX-2), a rate-limiting enzyme in the prostaglandin synthesis pathway, is overexpressed in many cancers and contributes to cancer progression through tumor cell-autonomous and paracrine effects. Regular use of non-steroidal anti-inflammat ...

2012

Optically-Clocked Instruction Set Extensions for High Efficiency Embedded Processors

Edoardo Charbon, Ties Jan Henderikus Kluter, Claudio Favi, Christian Mester

We propose a technique to localize computation in Instruction Set Extensions (ISEs) that are clocked at very high speed with respect to the processor. In order to save power, data to and from Custom Instruction Units (CIUs) is synchronized via an optical s ...

2012

Projective modules over the real algebraic sphere of dimension 3

Jean Fasel

Let A be a commutative noetherian ring of Krull dimension 3. We give a necessary and sufficient condition for A-projective modules of rank 2 to be free. Using this, we show that all the finitely generated projective modules over the algebraic real 3-sphere ...

2010

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