Publication

Efficient lattice Green's function method for bounded domain problems

Publications associées (61)

A Reduced Order Model for Domain Decompositions with Non-conforming Interfaces

In this paper, we propose a reduced-order modeling strategy for two-way Dirichlet-Neumann parametric coupled problems solved with domain-decomposition (DD) sub-structuring methods. We split the original coupled differential problem into two sub-problems wi ...

New York2024

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

ELSEVIER SCIENCE INC2023

Metal Circus: Abstraction and Method in Aldo Rossi’s Early Work

Pier Vittorio Aureli

The essay focuses on the early work of Aldo Rossi, for the most part produced in collaboration with Gianugo Polesello, Luca Meda and Giorgio Grassi. In the early 1960s Rossi attempted to define a design method in which the juxtaposition of a limited set of ...

2023

Electroadhesion is a versatile and controllable adhesion mechanism that has been used extensively in robotics. Soft electroadhesion embodies electrostatic adhesion in soft materials and is required for shape-adaptive and safe grasping of curved objects and ...

IEEE2022

Tensor-Based Numerical Method For Stochastic Homogenization

This paper addresses the complexity reduction of stochastic homogenization of a class of random materials for a stationary diffusion equation. A cost-efficient approximation of the correctors is obtained using a method designed to exploit quasi-periodicity ...

SIAM PUBLICATIONS2022

MATHICSE Technical Report: Immersed Boundary-Conformal Isogeometric Method for Linear Elliptic Problems

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

We present a novel isogeometric method, namely the Immersed Boundary-Conformal Method (IBCM), that features a layer of discretization conformal to the boundary while employing a simple background mesh for the remaining domain. In this manner, we leverage t ...

MATHICSE2021

Immersed boundary-conformal isogeometric method for linear elliptic problems

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

2021

A Minimal Stabilization Procedure for Isogeometric Methods on Trimmed Geometries

Annalisa Buffa, Rafael Vazquez Hernandez, Riccardo Puppi

Trimming is a common operation in computer aided design and, in its simplest formulation, consists in removing superfluous parts from a geometric entity described via splines (a spline patch). After trimming, the geometric description of the patch remains ...

2020

MATHICSE Technical Report : A minimal stabilization procedure for isogeometric methods on trimmed geometries

Annalisa Buffa, Rafael Vazquez Hernandez, Riccardo Puppi

Trimming is a common operation in CAD, and, in its simplest formulation, consists in removing superfluous parts from a geometric entity described via splines (a spline patch). After trimming the geometric description of the patch remains unchanged, but the ...

MATHICSE2019

Compound micromachines powered by acoustic streaming

Mahmut Selman Sakar, Furkan Ayhan, Murat Kaynak

This paper presents the design, fabrication, and operation of compound micromachines powered by acoustic streaming. The machine components were directly incorporated around pillars serving as shafts without further assembly steps using a single-step in sit ...

IEEE2019

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