On the asymptotic optimality of spectral coarse spaces

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

We analyze the numerical performance of a preconditioning technique recently proposed in [1] for the efficient solution of parametrized linear systems arising from the finite element (FE) discretization of parameter-dependent elliptic partial differential ...

We consider a critical point u(0) of a functional f is an element of C-1 (H, R), where H is a real Hilbert space, and formulate criteria ensuring that u(0) lies in a potential well of f without supposing that f' is Frechet differentiable at u(0). The deriv ...

This work studies the problem of statistical inference for Fréchet means in the Wasserstein space of measures on Euclidean spaces,

\mathcal W_2 ( \mathbb R^d )

. This question arises naturally from the problem of separating amplitude and phase variation i ...

We propose and analyse a new discontinuous reduced basis element method for the approximation of parametrized elliptic PDEs in partitioned domains. The method is built upon an offline stage (parameter independent) and an online (parameter dependent) one. I ...

Domain-decomposition (DD) methods are used in most, if not all, modern parallel implementations of finite element modeling software. In the solver stage, the algebraic additive Schwarz (AAS) domain-decomposition preconditioner represents a fundamental comp ...

This thesis addresses the development and implementation of efficient and parallel algorithms for the numerical simulation of Fluid-Structure Interaction (FSI) problems in hemodynamics. Indeed, hemodynamic conditions in large arteries are significantly aff ...

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

A method for achieving a representation of an object within a data structure for a Computer Aided Design system employing a Medial Axis Transformation (MAT), the representation of the object comprising a set of adjacent bounded surface elements called MAT ...

We present new results on the Relaxed Dimensional Factorization (RDF) preconditioner for solving saddle point problems from incompressible flow simulations, first introduced in Benzi et al. (2011). This method contains a parameter α>0α>0, to be chosen by t ...

The focus of this thesis is on developing efficient algorithms for two important problems arising in model reduction, estimation of the smallest eigenvalue for a parameter-dependent Hermitian matrix and solving large-scale linear matrix equations, by extra ...

On the asymptotic optimality of spectral coarse spaces

Chat with Graph Search

A numerical investigation of multi space reduced basis preconditioners for parametrized elliptic advection-diffusion equations

Criteria for the existence of a potential well

Fréchet means in Wasserstein space : theory and algorithms

A Discontinuous Galerkin Reduced Basis Element Method For Elliptic Problems

Parallel subdomain solver strategies for the algebraic additive Schwarz preconditioner

Parallel Algorithms for the Solution of Large-Scale Fluid-Structure Interaction Problems in Hemodynamics

Space lower bounds for low-stretch greedy embeddings

Medial axis transformation as a solid modeling representation method for computer aided design software

Parameter estimates for the Relaxed Dimensional Factorization preconditioner and application to hemodynamics

Low-rank methods for parameter-dependent eigenvalue problems and matrix equations