Related papers: Optimal convergence order for multi-scale stochast…
In this article, we show how the theory of rough paths can be used to provide a notion of solution to a class of nonlinear stochastic PDEs of Burgers type that exhibit too high spatial roughness for classical analytical methods to apply. In…
In this paper, we investigate the stochastic damped Burgers equation with multiplicative noise defined on the entire real line. We demonstrate the existence and uniqueness of a mild solution to the stochastic damped Burgers equation and…
We prove precise rates of convergence for monotone approximation schemes of fractional and nonlocal Hamilton-Jacobi-Bellman (HJB) equations. We consider diffusion corrected difference-quadrature schemes from the literature and new…
Many reduced order models are neither robust with respect to the parameter changes nor cost-effective enough for handling the nonlinear dependence of complex dynamical systems. In this study, we put forth a robust machine learning framework…
In this paper, we study the numerical stability of reduced order models for convection-dominated stochastic systems in a relatively simple setting: a stochastic Burgers equation with linear multiplicative noise. Our preliminary results…
Stochastic nonconvex optimization problems with nonlinear constraints have a broad range of applications in intelligent transportation, cyber-security, and smart grids. In this paper, first, we propose an inexact-proximal accelerated…
We analyze stochastic partial differential equations (SPDEs) with quadratic nonlinearities close to a change of stability. To this aim we compute finite-time Lyapunov exponents (FTLEs), observing a change of sign based on the interplay…
We develop ergodic theory of the inviscid Burgers equation with random kick forcing in noncompact setting. The results are parallel to those in our recent work on the Burgers equation with Poissonian forcing. However, the analysis based on…
Presenting a general phase approach to stochastic processes we analyze in particular the Fokker-Planck equation for the noisy Burgers equation and discuss the time dependent and stationary probability distributions. In one dimension we…
Building on the well-posedness of the backward Kolmogorov partial differential equation in the Wasserstein space, we analyze the strong and weak convergence rates for approximating the unique solution of a class of McKean-Vlasov stochastic…
We study iterative finite element approximations for the numerical approximation of semilinear elliptic boundary value problems with monotone nonlinear reactions of subcritical growth. The focus of our contribution is on an optimal a priori…
We establish a rate of convergence of the two scale expansion (in the sense of homogenization theory) of the solution to a highly oscillatory elliptic partial differential equation with random coefficients that are a perturbation of…
A mathematical analysis is established for the weak Galerkin finite element methods for the Poisson equation with Dirichlet boundary value when the curved elements are involved on the interior edges of the finite element partition or/and on…
A numerical method for approximating weak solutions of an aggregation equation with degenerate diffusion is introduced. The numerical method consists of a stabilized finite element method together with a mass lumping technique and an extra…
We consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on…
A numerical method is proposed to compute a low-rank Galerkin approximation to the solution of a parametric or stochastic equation in a non-intrusive fashion. The considered nonlinear problems are associated with the minimization of a…
In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…
In this work, we investigate the inverse problem of recovering a potential coefficient in an elliptic partial differential equation from the observations at deterministic sampling points in the domain subject to random noise. We employ a…
We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are…
We analyze the adaptive first order algorithm AMSGrad, for solving a constrained stochastic optimization problem with a weakly convex objective. We prove the $\mathcal{\tilde O}(t^{-1/4})$ rate of convergence for the norm of the gradient of…