Related papers: Robust approximation error estimates and multigrid…
In this paper we investigate an adaptive discretization strategy for ill-posed linear prob- lems combined with a regularization from a class of semiiterative methods. We show that such a discretization approach in combination with a…
Future e-mobility calls for efficient electrical machines. For different areas of operation, these machines have to satisfy certain desired properties that often depend on their design. Here we investigate the use of multipatch Isogeometric…
We present a mesh-independent and parameter-robust multigrid solver for the Scott-Vogelius discretisation of the nearly incompressible linear elasticity equations on meshes with a macro element structure. The discretisation achieves exact…
The efficient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for…
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…
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…
We consider the finite difference discretization of isotropic elastic wave equations on nonuniform grids. The intended applications are seismic studies, where heterogeneity of the earth media can lead to severe oversampling for simulations…
Uni- and bivariate data smoothing with spline functions is a well established method in nonparametric regression analysis. The extension to multivariate data is straightforward, but suffers from exponentially increasing memory and…
Computing at the exascale level is expected to be affected by a significantly higher rate of faults, due to increased component counts as well as power considerations. Therefore, current day numerical algorithms need to be reexamined as to…
In this manuscript, we present a collective multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty, and develop a novel convergence…
We study a multigrid method for solving large linear systems of equations with tensor product structure. Such systems are obtained from stochastic finite element discretization of stochastic partial differential equations such as the…
Analysis-suitable $G^1$ (AS-$G^1$) multi-patch spline surfaces [4] are particular $G^1$-smooth multi-patch spline surfaces, which are needed to ensure the construction of $C^1$-smooth multi-patch spline spaces with optimal polynomial…
Vertex-patch smoothers are essential for the robust convergence of geometric multigrid methods in high-order finite element applications, yet their adoption is traditionally hindered by the prohibitive cost of solving local patch problems.…
In this paper, we propose a $W$-cycle $p$-multigrid method for solving the $p$-version symmetric interior penalty discontinuous Galerkin (SIPDG) discretization of elliptic problems. This SIPDG discretization employs hierarchical Legendre…
An Isogeometric Boundary Element Method (IgA-BEM) is considered for the numerical solution of Helmholtz problems on 3D bounded or unbounded domains, admitting a smooth conformal multi-patch representation of their finite boundary surface.…
We develop a multigrid solver for the second biharmonic problem in the context of Isogeometric Analysis (IgA), where we also allow a zero-order term. In a previous paper, the authors have developed an analysis for the first biharmonic…
We present a multigrid algorithm for the solution of the linear systems of equations stemming from the $p-$version of the Virtual Element discretization of a two-dimensional Poisson problem. The sequence of coarse spaces are constructed…
In this work, we present a multiscale approach for the reliable coarse-scale approximation of spatial network models represented by a linear system of equations with respect to the nodes of a graph. The method is based on the ideas of the…
We present an efficient numerical method, inspired by transformation optics, for solving the Poisson equation in complex and arbitrarily shaped geometries. The approach operates by mapping the physical domain to a uniform computational…
We show that the semi-implicit time discretization approaches previously introduced for multilayer shallow water models for the barotropic case can be also applied to the variable density case with Boussinesq approximation. Furthermore,…