Related papers: Robust approximation error estimates and multigrid…
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…
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…
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…
Isogeometric Analysis is a high-order discretization method for boundary value problems that uses a number of degrees of freedom which is as small as for a low-order method. Standard isogeometric discretizations require a global…
In recent publications, the author and his coworkers have proposed a multigrid method for solving linear systems arizing from the discretization of partial differential equations in isogeometric analysis and have proven that the convergence…
The design of fast solvers for isogeometric analysis is receiving a lot of attention due to the challenge that offers to find an algorithm with a robust convergence with respect to the spline degree. Here, we analyze the application of…
In this paper, we develop multigrid solvers for the biharmonic problem in the framework of isogeometric analysis (IgA). In this framework, one typically sets up B-splines on the unit square or cube and transforms them to the domain of…
In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid…
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 (IgA) is a spline based approach to the numerical solution of partial differential equations. There are two major issues that IgA was designed to address. The first issue is the exact representation of domains stemming…
Isogeometric Analysis is a spline-based discretization method to partial differential equations which shows the approximation power of a high-order method. The number of degrees of freedom, however, is as small as the number of degrees of…
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.…
In this paper we provide a priori error estimates with explicit constants for both the $L^2$-projection and the Ritz projection onto spline spaces of arbitrary smoothness defined on arbitrary grids. This extends the results recently…
In this work, we study the approximation properties of multi-patch dG-IgA methods, that apply the multipatch Isogeometric Analysis (IgA) discretization concept and the discontinuous Galerkin (dG) technique on the interfaces between the…
This work develops a computational framework that combines physics-informed neural networks with multi-patch isogeometric analysis to solve partial differential equations on complex computer-aided design geometries. The method utilizes…
We present an isogeometric mortar method for the discretization of the biharmonic equation posed on multi-patch domains. We assume only $C^0$-conformity at interfaces and employs a mortar approach to weakly enforce $C^1$-continuity across…
In this paper, we develop approximation error estimates as well as corresponding inverse inequalities for B-splines of maximum smoothness, where both the function to be approximated and the approximation error are measured in standard…
We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…
In isogeometric analysis, isogeometric function spaces are employed for accurately representing the solution to a partial differential equation (PDE) on a parameterized domain. They are generated from a tensor-product spline space by…
In the context of isogeometric analysis, globally $C^1$ isogeometric spaces over unstructured quadrilateral meshes allow the direct solution of fourth order partial differential equations on complex geometries via their Galerkin…