Sous-espace vectoriel engendré

Science formelle
Mathématiques
Algèbre
Algèbre linéaire

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Dynamical low rank approximation for uncertainty quantification of time-dependent problems

Eva Vidlicková

The quantification of uncertainties can be particularly challenging for problems requiring long-time integration as the structure of the random solution might considerably change over time. In this respect, dynamical low-rank approximation (DLRA) is very a ...

EPFL2022

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

Tommaso Vanzan

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

2022

Elimination of ringing artifacts by finite-element projection in FFT-based homogenization

Till Junge, Ali Falsafi, Martin Ladecký

Micromechanical homogenization is often carried out with Fourier-accelerated methods that are prone to ringing artifacts. We here generalize the compatibility projection introduced by Vond.rejc et al. (2014) [24] beyond the Fourier basis. In particular, we ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Structure-preserving approaches and data-driven closure modeling for model order reduction

Nicolò Ripamonti

In this thesis, we propose model order reduction techniques for high-dimensional PDEs that preserve structures of the original problems and develop a closure modeling framework leveraging the Mori-Zwanzig formalism and recurrent neural networks. Since high ...

EPFL2022

Singularities of general fibers and the LMMP

Zsolt Patakfalvi, Joseph Allen Waldron

We use the theory of foliations to study the relative canonical divisor of a normalized inseparable base-change. Our main technical theorem states that it is linearly equivalent to a divisor with positive integer coefficients divisible by p - 1. We deduce ...

JOHNS HOPKINS UNIV PRESS2022

Motif Cut Sparsifiers

Mikhail Kapralov, Mikhail Makarov, Jakab Tardos

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

IEEE COMPUTER SOC2022

Development of advanced linearized gyrokinetic collision operators using a moment approach

Paolo Ricci, Justin Richard Ball, Louis Nicolas Stenger, Rogério Manuel Cabete De Jesus Jorge, Baptiste Jimmy Frei, Antoine Cyril David Hoffmann

The derivation and numerical implementation of a linearized version of the gyrokinetic (GK) Coulomb collision operator (Jorge et al., J. Plasma Phys., vol. 85, 2019, 905850604) and of the widely used linearized GK Sugama collision operator (Sugama et al., ...

Cambridge University Press2021

Mass-Zero constrained dynamics and statistics for the shell model in magnetic field

Sara Bonella, Alessandro Coretti, David Daniel Girardier

In several domains of physics, including first principle simulations and classical models for polarizable systems, the minimization of an energy function with respect to a set of auxiliary variables must be performed to define the dynamics of physical degr ...

EDP Sciences, Springer2021

Reduction techniques for PDEs built upon Reduced Basis and Domain Decomposition Methods with applications to hemodynamics

Luca Pegolotti

This thesis focuses on the development and validation of a reduced order technique for cardiovascular simulations. The method is based on the combined use of the Reduced Basis method and a Domain Decomposition approach and can be seen as a particular imple ...

EPFL2021

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

Page 2 sur 2