Related papers: Adaptive Refinement for Unstructured T-Splines wit…
Polynomial splines are ubiquitous in the fields of computer aided geometric design and computational analysis. Splines on T-meshes, especially, have the potential to be incredibly versatile since local mesh adaptivity enables efficient…
Adaptive meshing is a fundamental component of adaptive finite element methods. This includes refining and coarsening meshes locally. In this work, we are concerned with the red-green-blue refinement strategy in two dimensions and its…
In this paper we study the dimension of splines of mixed smoothness on axis-aligned T-meshes. This is the setting when different orders of smoothness are required across the edges of the mesh. Given a spline space whose dimension is…
During relativistic magnetic reconnection, antiparallel magnetic fields undergo a rapid change in topology, releasing a large amount of energy in the form of non-thermal particle acceleration. This work explores the application of mesh…
We consider the iterative reconstruction of both the internal geometry and the values of an inhomogeneous acoustic refraction index through a piecewise constant approximation. In this context, we propose two enhancements intended to reduce…
The rigorous convergence analysis of adaptive finite element methods for regularized variational models of quasi-static brittle fracture in strain-limiting elastic solids is presented. This work introduces two novel adaptive mesh refinement…
The estimation of distributed parameters in partial differential equations (PDE) from measures of the solution of the PDE may lead to under-determination problems. The choice of a parameterization is a usual way of adding a-priori…
This paper presents a novel p-adaptive, high-order mesh-free framework for the accurate and efficient simulation of fluid flows in complex geometries. High-order differential operators are constructed locally for arbitrary node…
A simple greedy refinement procedure for the generation of data-adapted triangulations is proposed and studied. Given a function of two variables, the algorithm produces a hierarchy of triangulations and piecewise polynomial approximations…
Reachable Minimally supported (RM) B-splines have been recently introduced as a novel B-spline--like basis. They feature local linear independence and admit a fast de Boor--like evaluation algorithm. These properties make them particularly…
We present an $n$-dimensional marked bisection method for unstructured conformal meshes. We devise the method for local refinement in adaptive $n$-dimensional applications. To this end, we propose a mesh marking pre-process and three marked…
This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the…
Iterative refinement (IR) is a popular scheme for solving a linear system of equations based on gradually improving the accuracy of an initial approximation. Originally developed to improve upon the accuracy of Gaussian elimination,…
In this paper, we propose a solution for a fundamental problem in computational harmonic analysis, namely, the construction of a multiresolution analysis with directional components. We will do so by constructing subdivision schemes which…
We present a new inner-outer iterative algorithm for edge enhancement in imaging problems. At each outer iteration, we formulate a Tikhonov-regularized problem where the penalization is expressed in the 2-norm and involves a regularization…
It has now become customary in the field of numerical relativity to couple high order finite difference schemes to mesh refinement algorithms. To this end, different modifications to the standard Berger-Oliger adaptive mesh refinement…
In this paper we propose a method to generate suitably refined finite element meshes using neural networks. As a model problem we consider a linear elasticity problem on a planar domain (possibly with holes) having a polygonal boundary. We…
We consider within a finite element approach the usage of different adaptively refined meshes for different variables in systems of nonlinear, time-depended PDEs. To resolve different solution behaviours of these variables, the meshes can…
The concept of trimming, embedding, or immersing geometries into a computational background mesh has gained considerable attention in recent years, particularly in isogeometric analysis (IGA). In this approach, the physical domain is…
A numerical method is developed to solve linear semi-infinite programming problem (LSIP) in which the iterates produced by the algorithm are feasible for the original problem. This is achieved by constructing a sequence of standard linear…