相关论文: Isogeometric collocation for solving the biharmoni…
In this paper, we advocate a novel spline-based isogeometric approach for boundary elements and its efficient implementation. We compare solutions obtained by both an isogeometric approach, and a classical parametric higher-order approach…
In this paper, we study a spline collocation method for a numerical solution to the optimal transport problem We mainly solve the \MAE with the second boundary condition numerically by proposing a center matching algorithm. We prove a…
We consider the isogeometric analysis for fractional PDEs involving the fractional Laplacian in two dimensions. An isogeometric collocation method is developed to discretize the fractional Laplacian and applied to the fractional Poisson…
In this paper, we develop and study approximately smooth basis constructions for isogeometric analysis over two-patch domains. One key element of isogeometric analysis is that it allows high order smoothness within one patch. However, for…
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 prove $p$-robust approximation error estimates for $H^2$-conforming isogeometric discretizations over planar multi-patch domains. Possible applications are fourth order boundary value problems, like the biharmonic equation or…
We present a new solver for coupled nonlinear elliptic partial differential equations (PDEs). The solver is based on pseudo-spectral collocation with domain decomposition and can handle one- to three-dimensional problems. It has three…
Isogeometric Analysis (IgA) is a framework for setting up spline-based discretizations of partial differential equations, which has been introduced around a decade ago and has gained much attention since then. If large spline degrees are…
Isogeometric Analysis is a variant of the finite element method, where spline functions are used for the representation of both the geometry and the solution. Splines, particularly those with higher degree, achieve their full approximation…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
In this paper, we propose a numerical method for approximating the solution of a Cauchy singular integral equation defined on a closed, smooth contour in the complex plane. The coefficients and the right-hand side of the equation are…
The design of globally $C^s$-smooth ($s \geq 1$) isogeometric spline spaces over multi-patch geometries is a current and challenging topic of research in the framework of isogeometric analysis. In this work, we extend the recent methods…
In this paper we develop an isogeometric B\'ezier dual mortar method for the biharmonic problem on multi-patch domains. The well-posedness of the discrete biharmonic problem requires a discretization with $C^1$ continuous basis functions.…
We present an approximately $C^1$-smooth multi-patch spline construction which can be used in isogeometric analysis (IGA). A key property of IGA is that it is simple to achieve high order smoothness within a single patch. To represent more…
Isogeometric Analysis generalizes classical finite element analysis and intends to integrate it with the field of Computer-Aided Design. A central problem in achieving this objective is the reconstruction of analysis-suitable models from…
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…
The first step towards applying isogeometric analysis techniques to solve PDE problems on a given domain consists in generating an analysis-suitable mapping operator between parametric and physical domains with one or several patches from…
We introduce a new variational method for the numerical homogenization of divergence form elliptic, parabolic and hyperbolic equations with arbitrary rough ($L^\infty$) coefficients. Our method does not rely on concepts of ergodicity or…
Although Galerkin discretizations have been intensively employed in the IgA context, an efficient implementation requires special numerical quadrature rules when constructing the system of equations. To avoid this issue, isogeometric…
This paper discusses and analyses two domain decomposition approaches for electromagnetic problems that allow the combination of domains discretised by either N\'ed\'elec-type polynomial finite elements or spline-based isogeometric…