Model reduction of semiaffinely parameterized partial differential equations by two-level affine approximation

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.

The growing demand for online gait phase (GP) estimation, driven by advancements in exoskeletons and prostheses, has prompted numerous approaches in the literature. Some approaches explicitly use time, while others rely on state variables to estimate the G ...

A kernel method for estimating a probability density function from an independent and identically distributed sample drawn from such density is presented. Our estimator is a linear combination of kernel functions, the coefficients of which are determined b ...

Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...

We introduce the elliptical Ornstein-Uhlenbeck (OU) process, which is a generalisation of the well-known univariate OU process to bivariate time series. This process maps out elliptical stochastic oscillations over time in the complex plane, which are obse ...

Linear-Quadratic-Gaussian (LQG) control is a fundamental control paradigm that is studied in various fields such as engineering, computer science, economics, and neuroscience. It involves controlling a system with linear dynamics and imperfect observations ...

Within the context of contemporary machine learning problems, efficiency of optimization process depends on the properties of the model and the nature of the data available, which poses a significant problem as the complexity of either increases ad infinit ...

One of the most classical results in high-dimensional learning theory provides a closed-form expression for the generalisation error of binary classification with a single-layer teacher-student perceptron on i.i.d. Gaussian inputs. Both Bayes-optimal (BO) ...

The quantification of uncertainties can be particularly challenging for problems requiring long-time integration as the structure of the random solution might considerably change over time. In this respect, dynamical low-rank approximation (DLRA) is very a ...

Trimming consists of cutting away parts of a geometric domain, without reconstructing a global parametrization (meshing). It is a widely used operation in computer-aided design, which generates meshes that are unfitted with the described physical object. T ...

Local modifications of a computational domain are often performed in order to simplify the meshing process and to reduce computational costs and memory requirements. However, removing geometrical features of a domain often introduces a non-negligible error ...

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

Unknown-input observers (UIOs) allow for estimation of the states of an LTI system without knowledge of all inputs. In this letter, we provide a novel data-driven UIO based on behavioral system theory and the result known as Fundamental Lemma proposed by J ...

Removing geometrical details from a complex domain is a classical operation in computer aided design for simulation and manufacturing. This procedure simplifies the meshing process, and it enables faster simulations with less memory requirements. However, ...

Model reduction of semiaffinely parameterized partial differential equations by two-level affine approximation

Chat with Graph Search

State-Based Versus Time-Based Estimation of the Gait Phase for Hip Exoskeletons in Steady and Transient Walking

Density estimation in RKHS with application to Korobov spaces in high dimensions

Detecting whether a stochastic process is finitely expressed in a basis

The elliptical Ornstein-Uhlenbeck process

Distributionally Robust Linear Quadratic Control

Universal and adaptive methods for robust stochastic optimization

Learning curves for the multi-class teacher-student perceptron

Dynamical low rank approximation for uncertainty quantification of time-dependent problems

An a posteriori error estimator for isogeometric analysis on trimmed geometries

Analysis-aware defeaturing of complex geometries

TimeEvolver: A program for time evolution with improved error bound

Data-Driven Unknown-Input Observers and State Estimation

Adaptive analysis-aware defeaturing