Related papers: Fast multigrid solvers for conforming and non-conf…
In this paper, a novel isogeometric method for Biot's consolidation model is constructed and analyzed, using a four-field formulation where the unknown variables are the solid displacement, solid pressure, fluid flux, and fluid pressure.…
We introduce a finite element method for numerical upscaling of second order elliptic equations with highly heterogeneous coefficients. The method is based on a mixed formulation of the problem and the concepts of the domain decomposition…
In the Isogeometric Analysis (IGA) framework, the computational domain has very often a multipatch representation. The multipatch domain can be obtained by a volume segmentation of a boundary represented domain, e.g., provided by a Computer…
We study multilevel techniques, commonly used in PDE multigrid literature, to solve structured optimization problems. For a given hierarchy of levels, we formulate a coarse model that approximates the problem at each level and provides a…
This paper presents a novel method for solving partial differential equations on three-dimensional CAD geometries by means of immersed isogeometric discretizations that do not require quadrature schemes. It relies on a new developed…
In this article we suggest two discretization methods based on isogeometric analysis (IGA) for planar linear elasticity. On the one hand, we apply the well-known ansatz of weakly imposed symmetry for the stress tensor and obtain a…
This study presents a fair performance comparison of the continuous finite element method, the symmetric interior penalty discontinuous Galerkin method, and the hybridized discontinuous Galerkin method. Modern implementations of high-order…
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 consider the numerical solution of Poisson's equation on structured grids using geometric multigrid with nonstandard coarse grids and coarse level operators. We are motivated by the problem of developing high-order accurate numerical…
In this work, we propose an adaptive geometric multigrid method for the solution of large-scale finite cell flow problems. The finite cell method seeks to circumvent the need for a boundary-conforming mesh through the embedding of the…
Although isogeometric analysis exploits smooth B-spline and NURBS basis functions for the definition of discrete function spaces as well as for the geometry representation, the global smoothness in so-called multipatch parametrizations is…
A novel and efficient approach which is based on the framework of isogeometric analysis for elliptic homogenization problems is proposed. These problems possess highly oscillating coefficients leading to extremely high computational…
We present and analyze a new space-time parallel multigrid method for parabolic equations. The method is based on arbitrarily high order discontinuous Galerkin discretizations in time, and a finite element discretization in space. The key…
We present a comparison of different multigrid approaches for the solution of systems arising from high-order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the…
In order to perform isogeometric analysis with increased smoothness on complex domains, trimming, variational coupling or unstructured spline methods can be used. The latter two classes of methods require a multi-patch segmentation of the…
We propose and investigate new robust preconditioners for space-time Isogeometric Analysis of parabolic evolution problems. These preconditioners are based on a time parallel multigrid method. We consider a decomposition of the space-time…
This paper presents a numerical study on multigrid algorithms of $V$-cycle type for problems posed in the Hilbert space $H(\mathbf{curl})$ in three dimensions. The multigrid methods are designed for discrete problems originated from the…
A local weighted discontinuous Galerkin gradient discretization method for solving elliptic equations is introduced. The local scheme is based on a coarse grid and successively improves the solution solving a sequence of local elliptic…
In the present paper we concentrate on an important issue in constructing a good multigrid solver: the choice of an efficient smoother. We will introduce all-at-once multigrid solvers for optimal control problems which show robust…
We propose a multilevel approach for trace systems resulting from hybridized discontinuous Galerkin (HDG) methods. The key is to blend ideas from nested dissection, domain decomposition, and high-order characteristic of HDG discretizations.…