Related papers: Optimal artificial boundary condition for random e…
The main purpose of this work is to study uniform regularity estimates for a family of elliptic operators $\{\mathcal{L}_\varepsilon, \varepsilon>0\}$, arising in the theory of homogenization, with rapidly oscillating periodic coefficients.…
This paper focuses on the uniform boundary estimates in homogenization of a family of higher order elliptic operators $\mathcal{L}_\epsilon$, with rapidly oscillating periodic coefficients. We derive uniform boundary $C^{m-1,\lambda}…
In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely the obstacle problem. Since we adopt a numerical point of view, we first…
A central question in numerical homogenization of partial differential equations with multiscale coefficients is the accurate computation of effective quantities, such as the homogenized coefficients. Computing homogenized coefficients…
In the stochastic matching problem, we are given a general (not necessarily bipartite) graph $G(V,E)$, where each edge in $E$ is realized with some constant probability $p > 0$ and the goal is to compute a bounded-degree (bounded by a…
We study the averaging behavior of nonlinear uniformly elliptic partial differential equations with random Dirichlet or Neumann boundary data oscillating on a small scale. Under conditions on the operator, the data and the random media…
Recent results in non-convex stochastic optimization demonstrate the convergence of popular adaptive algorithms (e.g., AdaGrad) under the $(L_0, L_1)$-smoothness condition, but the rate of convergence is a higher-order polynomial in terms…
We consider the preconditioned conjugate gradient method (PCG) with optimal preconditioner in the frame of the boundary element method (BEM) for elliptic first-kind integral equations. Our adaptive algorithm steers the termination of PCG as…
In distributed optimization problems, a technique called gradient coding, which involves replicating data points, has been used to mitigate the effect of straggling machines. Recent work has studied approximate gradient coding, which…
In this paper, we introduce a multiscale framework based on adaptive edge basis functions to solve second-order linear elliptic PDEs with rough coefficients. One of the main results is that we prove the proposed multiscale method achieves…
In this work, we propose a high-order multiscale method for an elliptic model problem with rough and possibly highly oscillatory coefficients. Convergence rates of higher order are obtained using the regularity of the right-hand side only.…
We show error estimates for a cut finite element approximation of a second order elliptic problem with mixed boundary conditions. The error estimates are of low regularity type where we consider the case when the exact solution $u \in H^s$…
ADAGB2, a generalization of the Adagrad algorithm for stochastic optimization is introduced, which is also applicable to bound-constrained problems and capable of using second-order information when available. It is shown that, given…
In this paper, we consider stochastic homogenization of elliptic equations with unbounded and non-uniformly elliptic coefficients. Extending subadditive arguments, we get an estimate for the rate of the convergence of the solution of the…
A key quantity that occurs in the error analysis of several numerical methods for eigenvalue problems is the distance between the eigenvalue of interest and the next nearest eigenvalue. When we are interested in the smallest or fundamental…
We present a constructive method to devise boundary conditions for solutions of second-order elliptic equations so that these solutions satisfy specific qualitative properties such as: (i) the norm of the gradient of one solution is bounded…
We analyse the convergence of an approximate, fully inexact, ADMM algorithm under additive, deterministic and probabilistic error models. We consider the generalized ADMM scheme that is derived from generalized Lagrangian penalty with…
A numerical procedure providing guaranteed two-sided bounds on the effective coefficients of elliptic partial differential operators is presented. The upper bounds are obtained in a standard manner through the variational formulation of the…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
We carry out a comprehensive study of quantitative homogenization of second-order elliptic systems with bounded measurable coefficients that are almost-periodic in the sense of H. Weyl. We obtain uniform local $L^2$ estimates for the…