A combination technique for optimal control problems constrained by random PDEs
Related publications (38)
Graph Chatbot
Chat with Graph Search
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.
In 1971, the first microprocessor produced in mass production had 2300 transistor and was able to compute 60'000 operations per second at 740 kHz. Nowadays, even a common gaming console uses a central unit including 243 millions of transistors running at 4 ...
A fast and exact algorithm is developed for the spin +-2 spherical harmonics transforms on equi-angular pixelizations on the sphere. It is based on the Driscoll and Healy fast scalar spherical harmonics transform. The theoretical exactness of the transform ...
We consider the numerical approximation of a risk-averse optimal control problem for an elliptic partial differential equation (PDE) with random coefficients. Specifically, the control function is a deterministic, distributed forcing term that minimizes th ...
This thesis describes a successful application of advanced computational methods to tasks in the field of active structural control. The control-task involves finding good control movements for a highly coupled, non-linear structure. It is demonstrated how ...
Optimization arises naturally when process performance needs improvement. This is often the case in industry because of competition – the product has to be proposed at the lowest possible cost. From the point of view of control, optimization consists in de ...
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algo ...
This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so- ...
Abstract—In this paper, a model is proposed to analyze the influence of timing imperfections on ultra-wide bandwidth (UWB) time-hopping spread-spectrum (TH-SS) signaling schemes, where N pulses are coherently added to increase the received signal-tonoise r ...