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.
This article considers solving an overdetermined system of linear equations in peer-to-peer multiagent networks. The network is assumed to be synchronous and strongly connected. Each agent has a set of local data points, and their goal is to compute a line ...
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation Ax=b, where A is an m×n full-rank matrix, b is a column-vector of dimension m, and m (the number of equations) is larger tha ...
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AKXBKT=C. The most straightforward approach computes XRmxn from the solution of an mn x mn linear system, typically limiting the feasible values of m,n to a f ...
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation Ax=b, where A is an m×n full-rank matrix, b is a column-vector of dimension m, and m (the number of equations) is larger tha ...
We develop an algorithm for solving a system of diophantine equations with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction. It first finds a short vector satisfying the system of diophantine equations, and a set o ...
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 ...
Previously, G. Cornuejols and M. Dawande (1998) proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear programming based branch-and-bound. They offered these market split ...
State estimation is a widely used concept in the control community, and the literature mostly concentrates on the estimation of all states. However, in soft sensor problems, the emphasis is on estimating a few soft outputs as accurately as possible. The co ...
