Related papers: Estimates for generalized sparse grid hierarchical…

We provide an abstract framework for optimal goal-oriented adaptivity for finite element methods and boundary element methods in the spirit of [Carstensen et al., Comput. Math. Appl. 67 (2014)]. We prove that this framework covers standard…

We give a necessary condition for inclusion relations between discrete Morrey spaces which can be seen as a complement of the results in \cite{GKS,HS2}. We also prove another inclusion property of discrete Morrey spaces which can be viewed…

We introduce a new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace. We show that sparsifiers with a near-linear number of edges in the dimension of…

We propose and study an iterative substructuring method for an h-p Nitsche-type discretization, following the original approach introduced in [Bramble, Pasciack, Schatz (Math Comp. 1986)] for conforming methods. We prove quasi-optimality…

In this paper, we prove a discrete version of the generalized Riesz inequality on $\mathbb{Z}^d$. As a consequence, we will derive the extended Hardy-Littlewood and P\'olya-Szeg\"o inequalities. We will also establish cases of equality in…

Nowadays an increasing amount of data is available and we have to deal with models in high dimension (number of covariates much larger than the sample size). Under sparsity assumption it is reasonable to hope that we can make a good…

In this paper, we develop an upper bound for the SPARSEVA (SPARSe Estimation based on a VAlidation criterion) estimation error in a general scheme, i.e., when the cost function is strongly convex and the regularized norm is decomposable for…

This work introduces a new method to efficiently solve optimization problems constrained by partial differential equations (PDEs) with uncertain coefficients. The method leverages two sources of inexactness that trade accuracy for speed:…

The objective of this paper is to report on recent progress on Strichartz estimates for the Schr\"odinger equation and to present the state-of-the-art. These estimates have been obtained in Lebesgue spaces, Sobolev spaces and, recently, in…

We prove a sparse bound in the context of Schauder theory for divergence form elliptic partial differential equations. In addition, we show how an iteration argument inspired by sparse domination bounds can be used to deduce gradient…

We show that sparse spherical harmonic expansions can be efficiently recovered from a small number of randomly chosen samples on the sphere. To establish the main result, we verify the restricted isometry property of an associated…

Stochastic gradient descent (SGD) still is the workhorse for many practical problems. However, it converges slow, and can be difficult to tune. It is possible to precondition SGD to accelerate its convergence remarkably. But many attempts…

We develop efficient hierarchical preconditioners for optimal control problems governed by partial differential equations with uncertain coefficients. Adopting a discretize-then-optimize framework that integrates finite element…

This paper presents an efficient preconditioner for the Lippmann-Schwinger equation that combines the ideas of the sparsifying and the sweeping preconditioners. Following first the idea of the sparsifying preconditioner, this new…

In this paper, we present a multigrid preconditioner for solving the linear system arising from the piecewise linear nonconforming Crouzeix-Raviart discretization of second order elliptic problems with jump coefficients. The preconditioner…

We present an algebraic method for constructing a highly effective coarse grid correction to accelerate domain decomposition. The coarse problem is constructed from the original matrix and a small set of input vectors that span a low-degree…

We study a general family of space-time discretizations of the KPZ equation and show that they converge to its solution. The approach we follow makes use of basic elements of the theory of regularity structures [M. Hairer, A theory of…

We consider the numerical solution of Poisson's equation on structured grids using geometric multigrid with nonstandard coarse grids and coarse level operators. We are motivated by the problem of developing high-order accurate numerical…

We present a Ritz-Galerkin discretization on sparse grids using pre-wavelets, which allows to solve elliptic differential equations with variable coefficients for dimension $d=2,3$ and higher dimensions $d>3$. The method applies multilinear…

In the past decade, there are many works on the finite element methods for the fully nonlinear Hamilton--Jacobi--Bellman (HJB) equations with Cordes condition. The linearised systems have large condition numbers, which depend not only on…