Concept

Parametrization (geometry)

Publications associées (35)

Metastable de Sitter vacua in N=2 to N=1 truncated supergravity

Claudio Scrucca, Paul Smyth, Francesca Catino

We study the possibility of achieving metastable de Sitter vacua in general N=2 to N=1 truncated supergravities without vector multiplets, and compare with the situations arising in N=2 theories with only hypermultiplets and N=1 theories with only chiral m ...

Springer2012

Sampling Curves with Finite Rate of Innovation

Thierry Blu, Hanjie Pan, Pier Luigi Dragotti

We focus on a specific class of curves that can be parametrized using a finite number of variables in two dimensions. The corresponding indicator plane, which is a binary image, has infinite bandwidth and can not be sampled and perfectly reconstructed with ...

2011

Reduced basis approximation and error bounds for potential flows in parametrized geometries

Gianluigi Rozza

In this paper we consider (hierarchical, Lagrange) reduced basis approximation and a posteriori error estimation for potential flows in affinely parametrized geometries. We review the essential ingredients: i) a Galerkin projection onto a low dimensional s ...

2011

Free Form Deformation Techniques for 3D Shape Optimization Problems

Anwar Koshakji

The purpose of this work is to analyse and study an efficient parametrization technique for a 3D shape optimization problem. After a brief review of the techniques and approaches already available in literature, we choose to use the Free Form Deformation p ...

2011

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

Reduced basis methods for Stokes equations in domains with non-affine parameter dependence

Gianluigi Rozza

In this paper we deal with reduced basis techniques applied to Stokes equations. We consider domains with different shape, parametrized by affine and non-affine maps with respect to a reference domain. The proposed method is ideally suited for the repeated ...

Springer-Verlag2009

G-Chaplygin Systems With Internal Symmetries, Truncation, And An (Almost) Symplectic View Of Chaplygin'S Ball

Simon Hochgerner

Via compression ([18,8]) we write the n-dimensional Chaplygin sphere system as an almost Hamiltonian system on T*SO (n) with internal symmetry group SO (n-1). We show how this symmetry group can be factored out, and pass to the fully reduced system on (a f ...

2009

Reduced basis method for linear elasticity problems with many parameters

Alfio Quarteroni, Gianluigi Rozza

he reduced basis (RB) methods are proposed here for the solution of parametrized equations in linear elasticity problems. The fundamental idea underlying RB methods is to decouple the generation and projection stages (offline/online computational procedure ...

2008

Numerical solution of parametrized Navier-Stokes equations by reduced basis methods

Alfio Quarteroni, Gianluigi Rozza

We apply the reduced basis method to solve Navier-Stokes equations in parametrized domains. Special attention is devoted to the treatment of the parametrized nonlinear transport term in the reduced basis framework, including the case of nonaffine parametri ...

2007

Surface parameterization and optimum design methodology for hydraulic turbines

This thesis presents a methodology for the design optimization of hydraulic runner blades. The originality of the methodology comes from the geometric definition of the blade shapes, which uses parametric surfaces instead of a set of profiles. The main adv ...

EPFL2006

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