Related papers: Quadratic Serendipity Finite Elements on Polygons …
The main goal of the paper is to show new stability and localization results for the finite element solution of the Stokes system in $W^{1,\infty}$ and $L^{\infty}$ norms under standard assumptions on the finite element spaces on…
We present a novel family of $C^1$ quadrilateral finite elements, which define global $C^1$ spaces over a general quadrilateral mesh with vertices of arbitrary valency. The elements extend the construction by (Brenner and Sung, J. Sci.…
In this paper we propose a distributed version of a randomized block-coordinate descent method for minimizing the sum of a partially separable smooth convex function and a fully separable non-smooth convex function. Under the assumption of…
A conforming discontinuous Galerkin (DG) finite element method has been introduced in [21] on simplicial meshes, which has the flexibility of using discontinuous approximation and the simplicity in formulation of the classic continuous…
Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…
We present an analysis for a mixed finite element method for the bending problem of Koiter shell. We derive an error estimate showing that when the geometrical coefficients of the shell mid-surface satisfy certain conditions the finite…
We present a class of nonconforming virtual element methods for general fourth order partial differential equations in two dimensions. We develop a generic approach for constructing the necessary projection operators and virtual element…
This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…
Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…
In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…
We address multiscale elliptic problems with random coefficients that are a perturbation of multiscale deterministic problems. Our approach consists in taking benefit of the perturbative context to suitably modify the classical Finite…
In this article we develop convergence theory for a class of goal-oriented adaptive finite element algorithms for second order nonsymmetric linear elliptic equations. In particular, we establish contraction results for a method of this type…
New interpolation and quasi-interpolation operators of Cl\'ement- and Scott-Zhang-type are analyzed on anisotropic polygonal and polyhedral meshes. Since no reference element is available, an appropriate linear mapping to a reference…
We propose a simple and efficient scheme based on adaptive finite elements over conforming quadtree meshes for collapse plastic analysis of structures. Our main interest in kinematic limit analysis is concerned with both purely…
Local multiscale methods often construct multiscale basis functions in the offline stage without taking into account input parameters, such as source terms, boundary conditions, and so on. These basis functions are then used in the online…
In this paper we consider a problem of searching a space of predictive models for a given training data set. We propose an iterative procedure for deriving a sequence of improving models and a corresponding sequence of sets of non-linear…
We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…
We introduce a new class of unfitted finite element methods with high order accurate numerical integration over curved surfaces and volumes which are only implicitly defined by level set functions. An unfitted finite element method which is…
Random Fourier features provide a way to tackle large-scale machine learning problems with kernel methods. Their slow Monte Carlo convergence rate has motivated the research of deterministic Fourier features whose approximation error can…