Publication

Model order reduction of flow based on a modular geometrical approximation of blood vessels

Publications associées (71)

Multi-level preconditioner for solving the Navier-Stokes equations in hemodynamics applications

We present a multi-level algorithm to approximate the inverse of the fluid block in a Navier-Stokes saddle-point matrix where the coarse level is defined as a restriction of the degrees of freedom to those of lower order finite elements. A one-level scheme ...

2013

Shape optimization for viscous flows by reduced basis methods and free-form deformation

Alfio Quarteroni, Gianluigi Rozza, Andrea Manzoni

In this paper we further develop an approach previously introduced in [Lassila and Rozza, C.M.A.M.E 2010] for shape optimization that combines a suitable low-dimensional parametrization of the geometry (yielding a geometrical reduction) with reduced basis ...

Wiley-Blackwell2012

Model reduction techniques for fast blood flow simulation in parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Andrea Manzoni

In this paper we propose a new model reduction technique aimed at real-time blood flow simulations on a given family of geometrical shapes of arterial vessels. Our approach is based on the combination of a low-dimensional shape parametrization of the compu ...

2012

A two-level time step technique for the partitioned solution of one-dimensional arterial networks

Simone Deparis, Adelmo Cristiano Innocenza Malossi

In this work a numerical strategy to address the solution of the blood flow in one-dimensional arterial networks through a topology-based decomposition is presented. Such decomposition results in the local analysis of the blood flow in simple arterial segm ...

Elsevier2012

On the Reduction of Points on Abelian Varieties and Tori

Antonella Perucca

Let G be the product of an abelian variety and a torus defined over a number field K. Let R-1, ..., R-n be points in G(K). Let l be a rational prime, and let a(1), ..., a(n) be nonnegative integers. Consider the set of primes p of K satisfying the followin ...

2011

How Important is the Detection of Changes in Active Constraints in Real-Time Optimization?

Dominique Bonvin, Saurabh Anand Deshpande

In real-time optimization, enforcing the constraints that need to be active is important for optimality. In fact, it has been established in the context of parametric variations that, if these constraints are not satisfied, the optimality loss would be O($ ...

2011

Labelling Game for Twitter Streams

Valérian Hanser

The main goal of this project is to build a mean and to populate a database with correct information regarding some decided pairings. This database will then be compared to the results of algorithms that process the same pairings, which provides a way to a ...

2010

The Participation Payoff: Challenges and Opportunities for Multimedia Access in Networked Communities

Frédéric Dufaux

Increasingly, multimedia collections are associated with networked communities consisting of interconnected groups of users who create, annotate, share, view, critique and remix collection content. Information arises within networked communities via connec ...

2010

On the computation of structured singular values and pseudospectra

Daniel Kressner, Effrosyni Kokiopoulou

Structured singular values and pseudospectra play an important role in assessing the properties of a linear system under structured perturbations. This paper discusses computational aspects of structured pseudospectra for structures that admit an eigenvalu ...

2010

Critiquing Recommenders for Public Taste Products

Pearl Pu Faltings, Maoan Zhou

Critiquing-based recommenders do not require users to state all of their preferences upfront or rate a set of previously experienced products. Compared to other types of recommenders, they require relatively little user effort, especially initially, despit ...

ACM2009

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