Related papers: Effective grading refinement for locally linearly …
Localized features such as singularities, sharp gradients, discontinuities, and moving sources require adaptive finite element discretizations. Conventional refinement strategies introduce significant computational overhead through…
A fast algorithm for B-splines in mixed models is presented. B-splines have local support and are computational attractive, because the corresponding matrices are sparse. A key element of the new algorithm is that the local character of…
Accurately solving PDEs with localised features requires refined meshes that adapt to the solution. Traditional numerical methods, such as finite elements, are linear in nature and often ineffective for such problems, as the mesh is not…
This paper presents an adaptive discretization strategy for level set topology optimization of structures based on hierarchical B-splines. This work focuses on the influence of the discretization approach and the adaptation strategy on the…
We present a simple and efficient MATLAB implementation of the local refinement for polygonal meshes. The purpose of this implementation is primarily educational, especially on the teaching of adaptive virtual element methods.
B-splines of order $k$ can be viewed as a mapping $N$ taking a $(k+1)$-tuple of increasing real numbers $a_0 < \cdots < a_k$ and giving as a result a certain piecewise polynomial function. Looking at this mapping $N$ as a whole, basic…
A novel mesh refinement sensor is proposed for lattice Boltzmann methods (LBMs) applicable to either static or dynamic mesh refinement algorithms. The sensor exploits the kinetic nature of LBMs by evaluating the departure of distribution…
Based on spline manifolds we introduce and study a mathematical framework for analysis-suitable unstructured B-spline spaces. In this setting the parameter domain has a manifold structure, which allows for the definition of function spaces…
Easy to construct and optimally convergent generalisations of B-splines to unstructured meshes are essential for the application of isogeometric analysis to domains with non-trivial topologies. Nonetheless, especially for hexahedral meshes,…
Deep functional maps have emerged in recent years as a prominent learning-based framework for non-rigid shape matching problems. While early methods in this domain only focused on learning in the functional domain, the latest techniques…
We present an efficient approach of Finite Element Method (FEM)-based nonrigid image registration, in which the spatial transformation is constructed using truncated hierarchical B-splines (THB-splines). The image registration framework…
Spline functions have long been used in numerically solving differential equations. Recently it revives as isogeometric analysis, which uses NURBS for both parametrization and element functions. In this paper, we introduce some multivariate…
Multi-degree splines are smooth piecewise-polynomial functions where the pieces can have different degrees. We describe a simple algorithmic construction of a set of basis functions for the space of multi-degree splines, with similar…
Finite element approximations of minimal surface are not always precise. They can even sometimes completely collapse. In this paper, we provide a simple and inexpensive method, in terms of computational cost, to improve finite element…
We explore extended B-splines as a stable basis for isogeometric analysis with trimmed parameter spaces. The stabilization is accomplished by an appropriate substitution of B-splines that may lead to ill-conditioned system matrices. The…
We used a collocation method in refinable spline space to solve a linear dynamical system having fractional derivative in time. The method takes advantage of an explicit derivation rule for the B-spline basis that allows us to efficiently…
Iterative self-refinement is a simple inference-time strategy for machine translation: an LLM revises its own translation over multiple inference-time passes. Yet document-scale refinement remains poorly understood: 1) which pipelines work…
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 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…
We present a method to jointly refine the geometry and semantic segmentation of 3D surface meshes. Our method alternates between updating the shape and the semantic labels. In the geometry refinement step, the mesh is deformed with…