Related papers: MATLAB implementation of hp finite elements on rec…
We consider shape optimization problems subject to elliptic partial differential equations. In the context of the finite element method, the geometry to be optimized is represented by the computational mesh, and the optimization proceeds by…
Finite element methods usually construct basis functions and quadrature rules for multidimensional domains via tensor products of one-dimensional counterparts. While straightforward, this approach results in integration spaces larger than…
The envelope function method traditionally employs a single basis set which, in practice, relates to a single material because the $k\cdot p$ matrix elements are generally only known in a particular basis. In this work, we defined a basis…
In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The…
Hierarchies allow feature sharing between objects at multiple levels of representation, can code exponential variability in a very compact way and enable fast inference. This makes them potentially suitable for learning and recognizing a…
Hierarchical matrices approximate a given matrix by a decomposition into low-rank submatrices that can be handled efficiently in factorized form. $\mathcal{H}^2$-matrices refine this representation following the ideas of fast multipole…
We present an easily accessible, object oriented code (written exclusively in Matlab) for adaptive finite element simulations in 2D. It features various refinement routines for triangular meshes as well as fully vectorized FEM ansatz spaces…
In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coefficient functions. For this purpose we construct a generalized finite element basis that spans…
Weighted cone-volume functionals are introduced for the convex polytopes in $\mathbb{R}^n$. For these functionals, geometric inequalities are proved and the equality conditions are characterized. A variety of corollaries are derived,…
A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…
We introduce generalised finite difference methods for solving fully nonlinear elliptic partial differential equations. Methods are based on piecewise Cartesian meshes augmented by additional points along the boundary. This allows for…
We introduce a framework for the design of finite element methods for two-dimensional moving boundary problems with prescribed boundary evolution that have arbitrarily high order of accuracy, both in space and in time. At the core of our…
Matrix operations such as matrix inversion, eigenvalue decomposition, singular value decomposition are ubiquitous in real-world applications. Unfortunately, many of these matrix operations so time and memory expensive that they are…
High-order spatial discretisations and full discretisations of parabolic partial differential equations on evolving surfaces are studied. We prove convergence of the high-order evolving surface finite element method, by showing high-order…
We study the concept of (generalized) $p$-th variation of a real-valued continuous function along a general class of refining sequence of partitions. We show that the finiteness of the $p$-th variation of a given function is closely related…
We extend a classical approximation result of harmonic functions in planar domains due to Bernstein and Walsch to the setting of harmonic functions in Riemann surfaces. This result gives an exact characterization of the rate at which a…
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
I propose a vertex patch smoother where local problems are solved inexactly by a nested, matrix-free p-multigrid, creating a multigrid-within-multigrid framework. A single iteration of the local solver can be evaluated with…
This work is related to PHG (Parallel Hierarchical Grid). PHG is a toolbox for developing parallel adaptive finite element programs, which is under active development at the State Key Laboratory of Scientific and Engineering Computing. The…