Non-intrusive double-greedy parametric model reduction by interpolation of frequency-domain rational surrogates
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.
For lumped homogeneous reaction systems, this paper presents a kinetic model identification scheme that provides maximum-likelihood parameter estimates and guarantees convergence to global optimality. The use of the extent-based incremental approach allows ...
This article discusses the problem of time registration between navigation and imaging components on Micro Aerial Vehicles (MAVs). Accurate mapping with MAVs is gaining importance in applications such as corridor mapping, road and pipeline inspections or m ...
Control reserves are power generation or consumption entities that ensure balance of supply and demand of electricity in real-time. In many countries, they are procured through a market mechanism in which entities provide bids. The system operator determin ...
We propose a model order reduction approach for non-intrusive surrogate modeling of parametric dynamical systems. The reduced model over the whole parameter space is built by combining surrogates in frequency only, built at few selected values of the param ...
This work considers the numerical optimization of constrained batch and semi-batch processes, for which direct as well as indirect methods exist. Direct methods are often the methods of choice, but they exhibit certain limitations related to the compromise ...
This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the channel coefficients estimation subspace generate ...
We propose two novel conditional gradient-based methods for solving structured stochastic convex optimization problems with a large number of linear constraints. Instances of this template naturally arise from SDP-relaxations of combinatorial problems, whi ...
We propose a new non-perturbative method for studying UV complete unitary quantum field theories (QFTs) with a mass gap in general number of spacetime dimensions. The method relies on unitarity formulated as positive semi-definiteness of the matrix of inne ...
We propose a new proximal path-following framework for a class of constrained convex problems. We consider settings where the nonlinear-and possibly nonsmooth-objective part is endowed with a proximity operator, and the constraint set is equipped with a se ...
A novel method for approximating structured singular values (also known as values) is proposed and investigated. These quantities constitute an important tool in the stability analysis of uncertain linear control systems as well as in structured eigenvalue ...