Related papers: Adaptive optimization of isogeometric multi-patch …
Trimming is a common operation in CAD, and, in its simplest formulation, consists in removing superfluous parts from a geometric entity described via splines (a spline patch). After trimming the geometric description of the patch remains…
In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple…
The computational complexity of classical numerical methods for solving Partial Differential Equations (PDE) scales significantly as the resolution increases. As an important example, climate predictions require fine spatio-temporal…
We define a conforming B-spline discretisation of the de Rham complex on multipatch geometries. We introduce and analyse the properties of interpolation operators onto these spaces which commute w.r.t. the surface differential operators.…
This paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate…
Isogeometric analysis uses the same class of basis functions for both, representing the geometry of the computational domain and approximating the solution. In practical applications, geometrical patches are used in order to get flexibility…
We study the space of $C^{2}$-smooth isogeometric functions on bilinearly parameterized multi-patch domains $\Omega \subset \mathbb{R}^{2}$, where the graph of each isogeometric function is a multi-patch spline surface of bidegree $(d,d)$,…
We present a systematic study on higher-order penalty techniques for isogeometric mortar methods. In addition to the weak-continuity enforced by a mortar method, normal derivatives across the interface are penalized. The considered…
We introduce a new $hp$-adaptive strategy for self-adjoint elliptic boundary value problems that does not rely on using classical a posteriori error estimators. Instead, our approach is based on a generally applicable prediction strategy…
We introduce manifold-based basis functions for isogeometric analysis of surfaces with arbitrary smoothness, prescribed $C^0$ continuous creases and boundaries. The utility of the manifold-based surface construction techniques in…
Implicit Neural Representations (INRs) have emerged as a powerful tool for geometric representation, yet their suitability for physics-based simulation remains underexplored. While metrics like Hausdorff distance quantify surface…
This paper considers the approximation of spatial convolution with a given radial integral kernel. Previous studies have demonstrated that approximating spatial convolution using a system of partial differential equations (PDEs) can…
In this work we propose a deep adaptive sampling (DAS) method for solving partial differential equations (PDEs), where deep neural networks are utilized to approximate the solutions of PDEs and deep generative models are employed to…
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…
Many-query problems, arising from uncertainty quantification, Bayesian inversion, Bayesian optimal experimental design, and optimization under uncertainty-require numerous evaluations of a parameter-to-output map. These evaluations become…
In this paper, we propose a novel algorithm called Neuron-wise Parallel Subspace Correction Method (NPSC) for the finite neuron method that approximates numerical solutions of partial differential equations (PDEs) using neural network…
Many imaging problems require computing spatial transformations induced by spatially varying intensity, feature, or density fields. Canonical examples include distortion correction, deformable image registration, atlas-based segmentation,…
We study the space of $C^1$ isogeometric spline functions defined on trilinearly parameterized multi-patch volumes. Amongst others, we present a general framework for the design of the $C^1$ isogeometric spline space and of an associated…
We propose an algorithm for an optimal adaptive selection of points from the design domain of input random variables that are needed for an accurate estimation of failure probability and the determination of the boundary between safe and…
This paper presents a PDE-based planar parameterization framework with support for Truncated Hierarchical B-Splines (THB-splines). For this, we adopt the a posteriori refinement strategy of Dual Weighted Residual and present several…