Related papers: Generalised Sobolev Stable Flux Reconstruction
Converse optimality theory addresses an optimal control problem conversely where the system is unknown and the value function is chosen. Previous work treated this problem both in continuous and discrete time and non-extensively considered…
Observations which are realizations from some continuous process are frequent in sciences, engineering, economics, and other fields. We consider linear models, with possible random effects, where the responses are random functions in a…
We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…
First-order methods underpin most large-scale learning algorithms, yet their classical convergence guarantees hinge on carefully scheduled step-sizes that depend on the total horizon $T$, which is rarely known in advance. The Schedule-Free…
This paper studies the existence and global stability of generalized Ornstein-Uhlenbeck process for affine stochastic functional differential equations. Various very basic and important properties are established. In the applications, we…
The flux reconstruction (FR) method has gained popularity within the research community. The approach has been demonstrated to recover high-order methods such as the discontinuous Galerkin (DG) method. Stability analyses have been conducted…
A form of Sobolev inequalities for the symmetric gradient of vector-valued functions is proposed, which allows for arbitrary ground domains in $\mathbb R ^n$. In the relevant inequalities, boundary regularity of domains is replaced with…
Recently efforts have been made to use generalized sinc functions to perfectly reconstruct various kinds of non-bandlimited signals. As a consequence, perfect reconstruction sampling formulas have been established using such generalized…
The scaling of the exact solution of a hyperbolic balance law generates a family of scaled problems in which the source term does not depend on the current solution. These problems are used to construct a sequence of solutions whose…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
The work deals with two major topics concerning the numerical analysis of Runge-Kutta-like (RK-like) methods, namely their stability and order of convergence. RK-like methods differ from additive RK methods in that their coefficients are…
High-order tensor methods that employ Taylor-based local models (of degree $p\ge 3$) within adaptive regularization frameworks have been recently proposed for both convex and nonconvex optimization problems. They have been shown to have…
Some evolution equations with rough time-dependent potential are studied in the case of one-dimensional torus. We show that the solution has higher regularity for the generic values of the coupling constant. The asymptotics for large time…
In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…
Inverse problems are in many cases solved with optimization techniques. When the underlying model is linear, first-order gradient methods are usually sufficient. With nonlinear models, due to nonconvexity, one must often resort to…
We propose an alternating subgradient method with non-constant step sizes for solving convex-concave saddle-point problems associated with general convex-concave functions. We assume that the sequence of our step sizes is not summable but…
We present a reduced basis technique for long-time integration of parametrized incompressible turbulent flows. The new contributions are threefold. First, we propose a constrained Galerkin formulation that corrects the standard Galerkin…
Gradient-based first-order convex optimization algorithms find widespread applicability in a variety of domains, including machine learning tasks. Motivated by the recent advances in fixed-time stability theory of continuous-time dynamical…
A perturbative description of Large Scale Structure is a cornerstone of our understanding of the observed distribution of matter in the universe. Renormalization is an essential and defining step to make this description physical and…
This paper studies finite-time stability of a class of hybrid systems. We present sufficient conditions in terms of multiple generalized Lyapunov functions for the origin of the hybrid system to be finite-time stable. More specifically, we…