Algorithmes numériques et calcul haute performance - Chaire CADMOS
Laboratoire
Publications associées (333)
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.
Two-level domain decomposition methods are very powerful techniques for the efficient numerical solution of partial differential equations (PDEs). A two-level domain decomposition method requires two main components: a one-level preconditioner (or its corr ...
Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...
We study many-body localization (MBL) in a pair-hopping model exhibiting strong fragmentation of the Hilbert space. We show that several Krylov subspaces have both ergodic statistics in the thermodynamic limit and a dimension that scales much slower than t ...
In this paper, we extend the work of Günther-Hanssen (2020) in applying the INTERNODES method to problems in contact mechanics. In an initial work on this topic, Günther-Hanssen showed that the INTERNODES method could be successfully applied but also revea ...
This work develops novel rational Krylov methods for updating a large-scale matrix function f(A) when A is subject to low-rank modifications. It extends our previous work in this context on polynomial Krylov methods, for which we present a simplified conve ...
We use the method of interlacing families of polynomials to derive a simple proof of Bourgain and Tzafriri's Restricted Invertibility Principle, and then to sharpen the result in two ways. We show that the stable rank can be replaced by the Schatten 4-norm ...
We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and φ : G → GL(V ) is a non-trivial irreducible repres ...
This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function approximations tha ...
We prove equidistribution at shrinking scales for the monochromatic ensemble on a compact Riemannian manifold of any dimension. This ensemble on an arbitrary manifold takes a slowly growing spectral window in order to synthesize a random function. With hig ...
We present asymptotically sharp inequalities, containing a 2nd term, for the Dirichlet and Neumann eigenvalues of the Laplacian on a domain, which are complementary to the familiar Berezin-Li-Yau and Kroger inequalities in the limit as the eigenvalues tend ...