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.
We revisit the statistical mechanics of charge fluctuations in capacitors. In constant-potential classical molecular simulations, the atomic charges of electrode atoms are treated as additional degrees of freedom which evolve in time so as to satisfy the c ...
A new approach is presented to obtain a convex set of robust D—stabilizing fixed structure controllers, relying on Cauchy's argument principle. A convex set of D—stabilizing controllers around an initial D—stabilizing controller for a multi-model set is re ...
Elsevier2022
, ,
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 ...
Matrices with hierarchical low-rank structure, including HODLR and HSS matrices, constitute a versatile tool to develop fast algorithms for addressing large-scale problems. While existing software packages for such matrices often focus on linear systems, t ...
Block Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov ...
The Lyapunov exponent characterizes the asymptotic behavior of long matrix products. Recognizing scenarios where the Lyapunov exponent is strictly positive is a fundamental challenge that is relevant in many applications. In this work we establish a novel ...
The Schur decomposition of a square matrix A is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Compute a (m ...
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 ...
2021
, ,
We propose a principled method for projecting an arbitrary square matrix to the non- convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an information-theoretic sense and ...
2021
Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to higher-dimensional variants of g ...