Related papers: Effective grading refinement for locally linearly …
The Laplace eigenvalue problem on circular sectors has eigenfunctions with corner singularities. Standard methods may produce suboptimal approximation results. To address this issue, a novel numerical algorithm that enhances standard…
We introduce new manifold-based splines that are able to exactly reproduce B-splines on unstructured surface meshes. Such splines can be used in isogeometric analysis (IGA) to represent smooth surfaces of arbitrary topology. Since prevalent…
We present a robust and efficient multigrid method for single-patch isogeometric discretizations using tensor product B-splines of maximum smoothness. Our method is based on a stable splitting of the spline space into a large subspace of…
In this article, we establish optimality of the Bramble-Pasciak-Xu (BPX) norm equivalence and optimality of the wavelet modified (or stabilized) hierarchical basis (WHB) preconditioner in the setting of local 3D mesh refinement. In the…
Adaptive, locally refined and locally adjusted meshes are preferred over uniform meshes for capturing singular or localised solutions. Roughly speaking, for a given degree of freedom a solution associated with adaptive, locally refined and…
Finite element discretizations of problems in computational physics often rely on adaptive mesh refinement (AMR) to preferentially resolve regions containing important features during simulation. However, these spatial refinement strategies…
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well…
In this paper, we investigate $C^2$ super-smoothness of the full $C^1$ cubic spline space on a Powell-Sabin refined triangulation, for which a B-spline basis can be constructed. Blossoming is used to identify the $C^2$ smoothness conditions…
In recent work we have shown how an accurate reduced model can be utilized to perform mesh refinement in random space. That work relied on the explicit knowledge of an accurate reduced model which is used to monitor the transfer of activity…
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 article, we propose a fully-discrete scheme for the numerical solution of a nonlinear time-fractional biharmonic problem. This problem is first converted into an equivalent system by introducing a new variable. Then spatial and…
In this paper we consider spaces of bivariate splines of bi-degree (m, n) with maximal order of smoothness over domains associated to a two-dimensional grid. We define admissible classes of domains for which suitable combinatorial technique…
This paper presents a novel spline-based meshing technique that allows for usage of boundary-conforming meshes for unsteady flow and temperature simulations in co-rotating twin-screw extruders. Spline-based descriptions of arbitrary screw…
This study presents a meshless-based local reanalysis (MLR) method. The purpose of this study is to extend reanalysis methods to the Kriging interpolation meshless method due to its high efficiency. In this study, two reanalysis methods:…
In this paper we address a practical aspect of differential barrier penalty functions in linear programming. In this respect we propose an affine scaling interior point algorithm based on a large classe of differential barrier functions.…
A piecewise Chebyshevian spline space is good for design when it possesses a B-spline basis and this property is preserved under knot insertion. The interest in such kind of spaces is justified by the fact that, similarly as for polynomial…
Local meshless methods obtain higher convergence rates when RBF approximations are augmented with monomials up to a given order. If the order of the approximation method is spatially variable, the numerical solution is said to be p-refined.…
We consider H(curl)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by…
Recent advances in large language models (LLMs) have yielded impressive performance on various tasks, yet they often depend on high-quality feedback that can be costly. Self-refinement methods attempt to leverage LLMs' internal evaluation…
We present weighted quadrature for hierarchical B-splines to address the fast formation of system matrices arising from adaptive isogeometric Galerkin methods with suitably graded hierarchical meshes. By exploiting a local tensor-product…