Adaptive isogeometric analysis on two-dimensional trimmed domains based on a hierarchical approach

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

Page 2 sur 2

Pseudo-Three-Dimensional Analytical Model of Linear Induction Motors for High-Speed Applications

Mario Paolone, André Hodder, Simone Rametti, Lucien André Félicien Pierrejean

Literature on linear induction motors (LIMs) has proposed several approaches to model the behavior of such devices for different applications. In terms of accuracy and fidelity, field analysis-based models are the most relevant. Closed-form or numerical so ...

2024

Iterative removal of sources to model the turbulent electromotive force

Salim Bennouna, Abhijit Bhausaheb Bendre

We describe a novel method to compute the components of dynamo tensors from direct magnetohydrodynamic (MHD) simulations. Our method relies upon an extension and generalization of the standard H & ouml;gbom CLEAN algorithm widely used in radio astronomy to ...

Oxford Univ Press2024

Modeling friction and wear using an adaptive discrete-continuum coupling

Manon Eugénie Voisin--Leprince

When two objects slide against each other, wear and friction occur at their interface. The accumulation of wear forms what is commonly referred to as a ``third-body''. Understanding third-body evolution has significant applications in industry, where contr ...

EPFL2024

Analysis-aware defeaturing of complex geometries with Neumann features

Pablo Antolin Sanchez, Ondine Gabrielle Chanon

Local modifications of a computational domain are often performed in order to simplify the meshing process and to reduce computational costs and memory requirements. However, removing geometrical features of a domain often introduces a non-negligible error ...

Wiley2023

An equilibrated flux a posteriori error estimator for defeaturing problems

Annalisa Buffa, Rafael Vazquez Hernandez, Ondine Gabrielle Chanon

An a posteriori error estimator based on an equilibrated flux reconstruction is proposed for defeaturing problems in the context of finite element discretizations. Defeaturing consists in the simplification of a geometry by removing features that are consi ...

2023

A Shape Derivative Approach to Domain Simplification

Alessandra Arrigoni, Annalisa Buffa, Ondine Gabrielle Chanon, Jochen Peter Hinz

The objective of this study is to address the difficulty of simplifying the geometric model in which a differential problem is formulated, also called defeaturing, while simultaneously ensuring that the accuracy of the solution is maintained under control. ...

Elsevier Sci Ltd2023

ReLU Neural Network Galerkin BEM

Fernando José Henriquez Barraza

We introduce Neural Network (NN for short) approximation architectures for the numerical solution of Boundary Integral Equations (BIEs for short). We exemplify the proposed NN approach for the boundary reduction of the potential problem in two spatial dime ...

SPRINGER/PLENUM PUBLISHERS2023

Unbiased Likelihood Estimation of Wright–Fisher Diffusion Processes

Fabio Nobile

In this paper we propose a Monte Carlo maximum likelihood estimation strategy for discretely observed Wright–Fisher diffusions. Our approach provides an unbiased estimator of the likelihood function and is based on exact simulation techniques that are of s ...

Springer Cham2024

Nonparametric estimation for SDE with sparsely sampled paths: An FDA perspective

Victor Panaretos, Leonardo Vincenzo Santoro, Neda Mohammadi Jouzdani

We consider the problem of nonparametric estimation of the drift and diffusion coefficients of a Stochastic Differential Equation (SDE), based on n independent replicates {Xi(t) : t is an element of [0 , 1]}13 d B(t), where alpha is an element of {0 , 1} a ...

Elsevier2024

Low-Rank Tensor Methods for High-Dimensional Problems

Christoph Max Strössner

In this thesis, we propose and analyze novel numerical algorithms for solving three different high-dimensional problems involving tensors. The commonality of these problems is that the tensors can potentially be well approximated in low-rank formats. Ident ...

EPFL2023

The elliptical Ornstein-Uhlenbeck process

Sofia Charlotta Olhede

We introduce the elliptical Ornstein-Uhlenbeck (OU) process, which is a generalisation of the well-known univariate OU process to bivariate time series. This process maps out elliptical stochastic oscillations over time in the complex plane, which are obse ...

INT PRESS BOSTON, INC2023