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.
Using the backstepping approach we recover the null controllability for the heat equations with variable coefficients in space in one dimension and prove that these equations can be stabilized in finite time by means of periodic time-varying feedback laws. ...
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 ...
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 ...
In this paper, we investigate the limiting absorption principle associated to and the well-posedness of the Helmholtz equations with sign changing coefficients which are used to model negative index materials. Using the reflecting technique introduced in [ ...
Following earlier work on some special cases [17,11] and on the analogous problem in higher dimensions [10,20], we make a more thorough investigation of the bifurcation points for a nonlinear boundary value problem of the form -{A(x)u' (x)}'.= f (lambda, x ...
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 ...
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 describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables. By rela ...
This paper proposes a novel algorithmic framework to solve image restoration problems under sparsity assumptions. As usual, the reconstructed image is the minimum of an objective functional that consists of a data fidelity term and an l1 regularization. Ho ...
Institute of Electrical and Electronics Engineers2013
The Letter proposes a method for phase estimation from a fringe pattern. The proposed method relies on a parametric approach where the phase is locally approximated as a two-dimensional (2D) polynomial, with the ensuing polynomial coefficients as the respe ...
