Concept

Calcul formel

Publications associées (54)

Developments in overlapping Schwarz preconditioning of high-order nodal discontinuous Galerkin discretizations

A preconditioned two-level overlapping Schwarz method for solving unstructured nodal discontinuous Galerkin discretizations of the indefinite Helmholtz problem is studied. We employ triangles in two dimensions and in a local discontinuous Galerkin (LDG) va ...

Springer2007

The Algebra of Connectors — Structuring Interaction in BIP

Joseph Sifakis, Simon Bliudze

We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types are used to describe different modes of synchronisation: rendezvous and broadc ...

ACM2007

A Light Formulation of the E* Interpolated Path Replanner

Roland Philippsen

The E* algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions a ...

2006

A spectral multidomain penalty method model for the simulation of high Reynolds number localized incompressible stratified turbulence

Jan Sickmann Hesthaven

A spectral multidomain penalty method model has been developed for the simulation of high Reynolds number localized stratified turbulence. This is the first time that a penalty method, with a particular focus on subdomain interface treatment, has been used ...

2005

An Interpolated Dynamic Navigation Function

Roland Siegwart, Roland Philippsen

The E-star algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of an underlying smooth goal distance that takes into account a continuous notion ...

2005

An efficient algorithm for real-time estimation and prediction of dynamic OD table

Michel Bierlaire, Frank Crittin

The problem of estimating and predicting Origin-Destination (OD) tables is known to be important and difficult. In the specific context of Intelligent Transportation Systems (ITS), the dynamic nature of the problem and the real-time requirements make it ev ...

2004

Efficient simplification of point-sampled surfaces

Mark Pauly

In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchical clustering, iterative simplification, and particle simulation algorithms ...

2002

An algebraic 2-level domain decomposition preconditioner with applications to the compressible Euler equations

Marzio Sala

A domain decomposition technique to solve large-scale aerodynamics problems on unstructured grids is investigated. The linear system, arising when an implicit time-advancing scheme is used, is preconditioned using a Schwarz-based method. The key idea of th ...

2002

Semi-automatic generation of web-based computing environments for software libraries

Daniel Kressner

A set of utilities for generating web computing environments related to mathematical and engineering library software is presented. The web interface can be accessed from a standard world wide web browser with no need for additional software installations ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2002

Factorization methods for the numerical approximation of Navier-Stokes equations

Alfio Quarteroni

We investigate a general approach for the numerical approximation of incompressible Navier-Stokes equations based on splitting the original problem into successive subproblems which are cheaper to solve. The splitting is obtained through an algebraic appro ...

2000

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