We develop two Bramble-Pasciak-Xu-type preconditioners for second resp. fourth order elliptic problems on the surface of the two-sphere. To discretize the second order problem we use C^0 linear elements on the sphere, and for the fourth order problem we use C^1 finite elements of Powell-Sabin type on the sphere. The main idea why these BPX preconditioners work depends on this particular choice of basis. We prove optimality and provide numerical examples. Furthermore we numerically compare the BPX preconditioners with the suboptimal hierarchical basis preconditioners.status: publishe
We study the multi-level method for preconditioning a linear system arising from a Galerkin discreti...
Using the framework of operator or Caldéron preconditioning, uniform preconditioners are constructed...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
Abstract. We develop two Bramble{Pasciak{Xu-type preconditioners for second resp. fourth order ellip...
In this paper we propose a natural way to extend a bivariate Powell–Sabin (PS) B-spline basis on a p...
We develop preconditioners for systems arising from finite element discretizations of parabolic prob...
In the last years multilevel preconditioners like BPX became more and more popular for solving secon...
We consider elliptic PDEs (partial differential equations) in the framework of isogeometric analysis...
In this paper we present two hierarchically preconditioned methods for the fast solution of mesh equ...
Continuing the previous work in [4] done for the 2D-approach in this paper we describe the Yserentan...
Continuing the previous work in the preprint 97-11 done for the 2D-approach in this paper we describ...
This thesis presents a multi scale preconditioner to efficiently solve elliptic problems on unstruct...
We consider systems of mesh equations that approximate elliptic boundary value problems on arbitraty...
Systems of grid equations that approximate elliptic boundary value problems on locally modified grid...
For solving systems of grid equations approximating elliptic boundary value problems a method of c...
We study the multi-level method for preconditioning a linear system arising from a Galerkin discreti...
Using the framework of operator or Caldéron preconditioning, uniform preconditioners are constructed...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
Abstract. We develop two Bramble{Pasciak{Xu-type preconditioners for second resp. fourth order ellip...
In this paper we propose a natural way to extend a bivariate Powell–Sabin (PS) B-spline basis on a p...
We develop preconditioners for systems arising from finite element discretizations of parabolic prob...
In the last years multilevel preconditioners like BPX became more and more popular for solving secon...
We consider elliptic PDEs (partial differential equations) in the framework of isogeometric analysis...
In this paper we present two hierarchically preconditioned methods for the fast solution of mesh equ...
Continuing the previous work in [4] done for the 2D-approach in this paper we describe the Yserentan...
Continuing the previous work in the preprint 97-11 done for the 2D-approach in this paper we describ...
This thesis presents a multi scale preconditioner to efficiently solve elliptic problems on unstruct...
We consider systems of mesh equations that approximate elliptic boundary value problems on arbitraty...
Systems of grid equations that approximate elliptic boundary value problems on locally modified grid...
For solving systems of grid equations approximating elliptic boundary value problems a method of c...
We study the multi-level method for preconditioning a linear system arising from a Galerkin discreti...
Using the framework of operator or Caldéron preconditioning, uniform preconditioners are constructed...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...