Related papers: Machine Learning based refinement strategies for p…
Central schemes are frequently used for incompressible and compressible flow calculations. The present paper is the first in a forthcoming series where a new approach to a 2nd order accurate Finite Volume scheme operating on cartesian grids…
We introduce a family of Galerkin finite element methods which are constructed via recovery operators over element-wise discontinuous approximation spaces. This new family, termed collectively as recovered finite element methods (R-FEM) has…
In this paper, an error analysis of a three steps two level Galekin finite element method for the two dimensional transient Navier-Stokes equations is discussed. First of all, the problem is discretized in spatial direction by employing…
We revisit the cell-based smoothed finite element method (SFEM) for quadrilateral elements and extend it to arbitrary polygons and polyhedrons in 2D and 3D, respectively. We highlight the similarity between the SFEM and the virtual element…
In the present work, we investigate a cut finite element method for the parameterized system of second-order equations stemming from the splitting approach of a fourth order nonlinear geometrical PDE, namely the Cahn-Hilliard system. We…
We present a new $hp$-version space-time discontinuous Galerkin (dG) finite element method for the numerical approximation of parabolic evolution equations on general spatial meshes consisting of polygonal/polyhedral (polytopic) elements,…
The paper deals with the a posteriori error analysis of a virtual element method for the Steklov eigenvalue problem. The virtual element method has the advantage of using general polygonal meshes, which allows implementing very efficiently…
This paper presents the Virtual Element Method (VEM) for the modeling of crack propagation in 2D within the context of linear elastic fracture mechanics (LEFM). By exploiting the advantage of mesh flexibility in the VEM, we establish an…
We discuss Coarse Grid Projection (CGP) methodology as a guide for partial mesh refinement of incompressible flow computations for the first time. Based on it, if for a given spatial resolution the numerical simulation diverges or the…
Optimization algorithms for solving nonconvex inverse problem have attracted significant interests recently. However, existing methods require the nonconvex regularization to be smooth or simple to ensure convergence. In this paper, we…
This short note reports a new derivation of the optimal order of the a priori error estimates for conforming virtual element methods (VEM) on 3D polyhedral meshes based on an error equation. The geometric assumptions, which are necessary…
In recent years, significant advancements have been made in computational methods for analyzing masonry structures. Within the Finite Element Method, two primary approaches have gained traction: Micro and Macro Scale modeling, and their…
An efficient $hp$-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We…
A refinement of manifold data is a computational process, which produces a denser set of discrete data from a given one. Such refinements are closely related to multiresolution representations of manifold data by pyramid transforms, and…
A stabilizing/penalty term is often used in finite element methods with discontinuous approximations to enforce connection of discontinuous functions across element boundaries. Removing stabilizers from discontinuous finite element methods…
We propose a Discontinuous Galerkin method for the Poisson equation on polygonal tessellations in two dimensions, stabilized by penalizing, locally in each element $K$, a residual term involving the fluxes, measured in the norm of the dual…
In this thesis, a computational framework for microstructural modelling of transverse behaviour of heterogeneous materials is presented. The context of this research is part of the broad and active field of Computational Micromechanics,…
We utilize connections between molecular coarse-graining approaches and implicit generative models in machine learning to describe a new framework for systematic molecular coarse-graining (CG). Focus is placed on the formalism encompassing…
Motivated by the increasing availability of low- and mixed-precision arithmetic on modern hardware, we develop mixed-precision variants of Lloyd's algorithm for k-means clustering. The main ingredient is a family of mixed-precision kernels…
We present a neural network-based method for solving linear and nonlinear partial differential equations, by combining the ideas of extreme learning machines (ELM), domain decomposition and local neural networks. The field solution on each…