Related papers: Effective grading refinement for locally linearly …
The construction of B-spline wavelet bases on nonequispaced knots is extended to wavelets that are piecewise segments from any combination of smooth functions. The extended wavelet family thus provides multiresolution basis functions with…
We introduce a framework for spline spaces of hierarchical type, based on a parent-children relation, which is very convenient for the analysis as well as the implementation of adaptive isogeometric methods. Such framework makes it simple…
A mixed basis approach based on density functional theory is employed for low dimensional systems. The basis functions are taken to be plane waves for the periodic direction multiplied by B-spline polynomials in the non-periodic direction.…
Problems involving approximation from scattered data where data is arranged quasi-uniformly have been treated by RBF methods for decades. Treating data with spatially varying density has not been investigated with the same intensity, and is…
The main purpose of this article is to develop a novel refinement strategy for four-dimensional hybrid meshes based on cubic pyramids. This optimal refinement strategy subdivides a given cubic pyramid into a conforming set of congruent…
Accurate structural relaxation is critical for advanced materials design. Traditional approaches built on physics-derived first-principles calculations are computationally expensive, motivating the creation of machine-learning interatomic…
A finite element method using B-splines is presented and compared with a conventional finite element method of Lagrangian type. The efficiency of both methods has been investigated at the example of a coupled non-linear system of Dirac…
In stroke-based rendering, search methods often get trapped in local minima due to discrete stroke placement, while differentiable optimizers lack structural awareness and produce unstructured layouts. To bridge this gap, we propose a dual…
Adaptive meshing includes local refinement as well as coarsening of meshes. Typically, coarsening algorithms are based on an explicit refinement history. In this work, we deal with local coarsening algorithms that build on the refinement…
This article introduces a novel approach for broken-FEEC (Finite Element Exterior Calculus), extending its application to locally refined spline spaces with non-matching interfaces. Traditional broken-FEEC allows for discontinuous…
Converting quad meshes to smooth manifolds, guided subdivision offers a way to combine the good highlight line distributions of recent G-spline constructions with the refinability of subdivision surfaces. Specifically, we present a C2…
In this work, we study the affine-constrained $\ell_1$ regularizers, which frequently arise in statistical and machine learning problems across a variety of applications, including microbiome compositional data analysis and sparse subspace…
In simulation technology, computationally expensive objective functions are often replaced by cheap surrogates, which can be obtained by interpolation. Full grid interpolation methods suffer from the so-called curse of dimensionality,…
The automation of composite sheet layup is essential to meet the increasing demand for composite materials in various industries. However, draping plans for the robotic layup of composite sheets are not robust. A plan that works well under…
In [L. Chen and R. Li, Journal of Scientific Computing, Vol. 68, pp. 1172--1197, (2016)], an integrated linear reconstruction was proposed for finite volume methods on unstructured grids. However, the geometric hypothesis of the mesh to…
The estimation of functions with varying degrees of smoothness is a challenging problem in the nonparametric function estimation. In this paper, we propose the LABS (L\'{e}vy Adaptive B-Spline regression) model, an extension of the LARK…
Adaptivity and local mesh refinement are crucial for the efficient numerical simulation of wave phenomena in complex geometry. Local mesh refinement, however, can impose a tiny time-step across the entire computational domain when using…
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…
We introduce a smooth B-spline discretization in polar coordinates on the unit disc that corrects the loss of regularity present at the origin caused by the coordinate singularity in standard tensor-product B-spline formulations. The method…
We introduce a low-rank framework for adaptive isogeometric analysis with truncated hierarchical B-splines (THB-splines) that targets the main bottleneck of local refinement: memory- and time-intensive matrix assembly once the global…