Concept

Théorème des facteurs invariants

Publications associées (87)

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

Correlating long-term performance and aging behaviour of building integrated PV modules

Christophe Ballif, Alessandro Francesco Aldo Virtuani, Ebrar Özkalay

Because building-integrated photovoltaic (BIPV) modules are fully integrated into a building envelope, the back of the module can be exposed to little or no ventilation, resulting in increased operating temperatures. As the temperature increases, the perfo ...

Elsevier Science Sa2024

The multivariate Serre conjecture ring

Luc Guyot

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

San Diego2023

Cohomology in singular blocks of parabolic category O

Jonathan Gruber

We determine the dimensions of Ext -groups between simple modules and dual generalized Verma modules in singular blocks of parabolic versions of category O for complex semisimple Lie algebras and affine Kac-Moody algebras. ...

2023

Detecting whether a stochastic process is finitely expressed in a basis

Victor Panaretos, Neda Mohammadi Jouzdani

Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

Volkan Cevher, Kimon Antonakopoulos, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi, Ali Kavis

We propose an adaptive variance-reduction method, called AdaSpider, for minimization of L-smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines an AdaGrad-inspired [Duchi et al., 2011, McMahan & Streeter, 2010], but a fai ...

2022

On complete reducibility of tensor products of simple modules over simple algebraic groups

Jonathan Gruber

Let G be a simply connected simple algebraic group over an al- gebraically closed ﬁeld k of characteristic p > 0. The category of rationalG-modules is not semisimple. We consider the question of when the tensorproduct of two simple G-modules L(λ) and L(μ) ...

2021

Structure of multicorrelation sequences with integer part polynomial iterates along primes

Florian Karl Richter

Let T be a measure-preserving Zℓ-action on the probability space (X,B,μ), let q1,…,qm:R→Rℓ be vector polynomials, and let f0,…,fm∈L∞⁡(X). For any ϵ>0 and multicorrelation sequences of the form α⁡(n)=∫Xf0⋅T⌊q1⁡(n)⌋⁢f1⋯T⌊qm⁡(n)⌋⁢fmd⁢μ we show that there exis ...

2021

Spherical cap harmonic analysis (SCHA) for characterising the morphology of rough surface patches

Katrin Beyer, Mahmoud S. M. Shaqfa

We use spherical cap harmonic (SCH) basis functions to analyse and reconstruct the morphology of scanned genus-0 rough surface patches with open edges. We first develop a novel one-to-one conformal mapping algorithm with minimal area distortion for paramet ...

2021

Data management and modelling of composite materials fatigue behavior

In this paper, we will present an update for the previously developed CCFatigue computational tool. This tool has been built around several analysis methods for fatigue life predictions of composite materials and includes modules that allow analysis over c ...

2021

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