Topics
Finite elementsTopical concept
anisotropicBuilding
Abstract. We compare several multilevel coarsening strategies by using stable subspace splitting techniques. The obtained condition numbers give an answer on how well the coarsening strategies are suited for solving an anisotropic elliptic boundary value problem. Key words. Finite elements, multilevel algorithms, semi-coarsening. AMS subject classifications. 65N30, 65N55, 65N22
AbstractThe goal of this work is to derive and justify a multilevel preconditioner of optimal arithm...
Departing from Mulder's semi-coarsening technique for first-order PDEs, the notion of a grid of grid...
. An optimal iterative method for solving systems of linear algebraic equations arising from nonconf...
In this paper we introduce a new class of robust multilevel interface solvers for two-dimensional fi...
: We survey some of the recent research in developing multilevel algebraic solvers for elliptic prob...
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for...
this paper is to study the performance of multilevel preconditioning for nonsymmetric elliptic bound...
Elliptic boundary value problems are frequently posed on complicated domains, which cannot be covere...
In this paper, multiscale finite element methods (MsFEMs) and domain decomposition techniques are de...
We describe a projection framework for developing adaptive multi-scale methods for computing approxi...
Departing from Mulder's semi-coarsening technique for first order PDEs, the notion of a grid of grid...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
We investigate multilevel Schwarz domain decomposition preconditioners, to efficiently solve linear ...
In this paper we study some nonoverlapping domain decomposition methods for solving a class of ellip...
Abstract. Graph partitioning is a well-known optimization problem of great interest in theoretical a...
AbstractThe goal of this work is to derive and justify a multilevel preconditioner of optimal arithm...
Departing from Mulder's semi-coarsening technique for first-order PDEs, the notion of a grid of grid...
. An optimal iterative method for solving systems of linear algebraic equations arising from nonconf...
In this paper we introduce a new class of robust multilevel interface solvers for two-dimensional fi...
: We survey some of the recent research in developing multilevel algebraic solvers for elliptic prob...
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for...
this paper is to study the performance of multilevel preconditioning for nonsymmetric elliptic bound...
Elliptic boundary value problems are frequently posed on complicated domains, which cannot be covere...
In this paper, multiscale finite element methods (MsFEMs) and domain decomposition techniques are de...
We describe a projection framework for developing adaptive multi-scale methods for computing approxi...
Departing from Mulder's semi-coarsening technique for first order PDEs, the notion of a grid of grid...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
We investigate multilevel Schwarz domain decomposition preconditioners, to efficiently solve linear ...
In this paper we study some nonoverlapping domain decomposition methods for solving a class of ellip...
Abstract. Graph partitioning is a well-known optimization problem of great interest in theoretical a...
AbstractThe goal of this work is to derive and justify a multilevel preconditioner of optimal arithm...
Departing from Mulder's semi-coarsening technique for first-order PDEs, the notion of a grid of grid...
. An optimal iterative method for solving systems of linear algebraic equations arising from nonconf...
Add to ORKG