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.
Matrix equations of the kind A(1)X(2)+A(0)X+A(-1)=X, where both the matrix coefficients and the unknown are semi-infinite matrices belonging to a Banach algebra, are considered. These equations, where coefficients are quasi-Toeplitz matrices, are encounter ...
This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image, or sketch, of the matrix. These methods can preserve structural properties of the input matrix, such as positive-semidefinite ...
Society for Industrial and Applied Mathematics2017
Some new results are presented concerning the search and approximation of solutions of equations in metric spaces using functionals strictly subordinated to a convergent series and functionals compatible with a convergent series. These classes of functiona ...
Max-stable processes play an important role as models for spatial extreme events. Their complex structure as the pointwise maximum over an infinite number of random functions makes their simulation difficult. Algorithms based on finite approximations are o ...
This paper develops a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as positive-semideni ...
In this paper, we prove several extremal results for geometrically defined hypergraphs. In particular, we establish an improved lower bound, single exponentially decreasing in k, on the best constant delta > 0 such that the vertex classes P-1,...,P-k of ev ...
Society for Industrial and Applied Mathematics2016
Expectation propagation (EP) is a widely successful algorithm for variational inference. EP is an iterative algorithm used to approximate complicated distributions, typically to find a Gaussian approximation of posterior distributions. In many applications ...
This paper presents an approach for fixed-order Linear Parameter Varying (LPV) controller design with application to a 2 Degree-of-Freedom (2DOF) gyroscope experimental setup. Inner convex approximation of the non-convex set of all stabilizing fixed-order ...
In this paper, we propose an asymptotically stable joint-space dynamical system that captures desired behaviors in joint-space while stably converging towards a task-space attractor. To encode joint-space behaviors while meeting the stability criteria, the ...
In this paper we present some heuristic strategies to compute rapid and reliable approximations to stability factors in nonlinear, inf-sup stable parametrized PDEs. The efficient evaluation of these quantities is crucial for the rapid construction of a pos ...