Related papers: MATLAB implementation of hp finite elements on rec…
We develop a regularization operator based on smoothing on a locally defined length scale. This operator is defined on $L_1$ and has approximation properties that are given by the local regularity of the function it is applied to and the…
There is a set of rectangular macros with given dimensions, and there are wires connecting some pairs (or sets) of them. We have a placement area where these macros should be placed without overlaps in order to minimize the total length of…
Numerical algorithms for elliptic partial differential equations frequently employ error estimators and adaptive mesh refinement strategies in order to reduce the computational cost. We can extend these techniques to general vectors by…
We present new finite elements for solving the Riesz maps of the de Rham complex on triangular and tetrahedral meshes at high order. The finite elements discretize the same spaces as usual, but with different basis functions, so that the…
We introduce a finite element method for numerical upscaling of second order elliptic equations with highly heterogeneous coefficients. The method is based on a mixed formulation of the problem and the concepts of the domain decomposition…
We propose a general algorithm for non-conforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on h-refinement with a fixed polynomial order. The algorithm handles triangular,…
We elaborate on the interpretation of some mixed finite element spaces in terms of differential forms. First we develop a framework in which we show how tools from algebraic topology can be applied to the study of their cohomological…
The Hilbert spaces $H(\mathrm{curl})$ and $H(\mathrm{div})$ are needed for variational problems formulated in the context of the de Rham complex in order to guarantee well-posedness. Consequently, the construction of conforming subspaces is…
We develop a family of finite element spaces of differential forms defined on cubical meshes in any number of dimensions. The family contains elements of all polynomial degrees and all form degrees. In two dimensions, these include the…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
We present a class of discretisation spaces and H(div)-conformal elements that can be built on any polytope. Bridging the flexibility of the Virtual Element spaces towards the element's shape with the divergence properties of the…
The stability, robustness, accuracy, and efficiency of space-time finite element methods crucially depend on the choice of approximation spaces for test and trial functions. This is especially true for high-order, mixed finite element…
This paper provides applications of patching to quadratic forms and central simple algebras over function fields of curves over henselian valued fields. In particular, we use a patching approach to reprove and generalize a recent result of…
We examine the effect of numerical integration on the convergence of high order pyramidal finite element methods. Rational functions are indispensable to the construction of pyramidal interpolants so the conventional treatment of numerical…
A numerical framework is developed to solve various types of PDEs on complicated domains, including steady and time-dependent, non-linear and non-local PDEs, with different boundary conditions that can also include non-linear and non-local…
In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on…
In our previous works, we proved that the inverse of the stiffness matrix of an $h$-version finite element method (FEM) applied to scalar second order elliptic boundary value problems can be approximated at an exponential rate in the block…
We present here the General formulation of the problem of existence and construction of upper and lower envelope for an arbitrary function with values from the completion of the ordered set ${\rm S}$ for a certain class of functions with…
Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…
In computer graphics, smooth data reconstruction on 2D or 3D manifolds usually refers to subdivision problems. Such a method is only valid based on dense sample points. The manifold usually needs to be triangulated into meshes (or patches)…