Incomplete block factorisations are used to construct flexible preconditioners for iterative linear solvers. In practice these approaches have shown to be very effective and robust. Especially they are more suitable for parallel computer architectures when comparing to classic ILU preconditioning. In this paper we introduce residual smoothing into the forward/backward substitution in order to compensate the element dropping in the Schur complement
When simulating a mechanism from science or engineering, or an industrial process, one is frequently...
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a gen...
AbstractThis paper introduces several strategies to deal with pivot blocks in multi-level block inco...
Incomplete block factorisations are used to construct flexible preconditioners for iterative l...
In this chapter, we give a brief overview of a particular class of preconditioners known as incomple...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
Incomplete LU (ILU) preconditioning is typically used when an iterative solver is applied on an asym...
We study two implementation strategies to utilize Schur complement technique in multilevel recursive...
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner...
In this paper we introduce LORASC, a robust algebraic preconditioner for solving sparse linear syste...
. In this chapter, we give a brief overview of a particular class of preconditioners known as incomp...
. We introduce block versions of the multi-elimination incomplete LU (ILUM) factorization preconditi...
AbstractWe develop in this paper a multilevel block ILU preconditioner for solving sparse nonsymmetr...
AbstractA considerable interest has been devoted to block matrix incomplete factorization preconditi...
When simulating a mechanism from science or engineering, or an industrial process, one is frequently...
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a gen...
AbstractThis paper introduces several strategies to deal with pivot blocks in multi-level block inco...
Incomplete block factorisations are used to construct flexible preconditioners for iterative l...
In this chapter, we give a brief overview of a particular class of preconditioners known as incomple...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
Incomplete LU (ILU) preconditioning is typically used when an iterative solver is applied on an asym...
We study two implementation strategies to utilize Schur complement technique in multilevel recursive...
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner...
In this paper we introduce LORASC, a robust algebraic preconditioner for solving sparse linear syste...
. In this chapter, we give a brief overview of a particular class of preconditioners known as incomp...
. We introduce block versions of the multi-elimination incomplete LU (ILUM) factorization preconditi...
AbstractWe develop in this paper a multilevel block ILU preconditioner for solving sparse nonsymmetr...
AbstractA considerable interest has been devoted to block matrix incomplete factorization preconditi...
When simulating a mechanism from science or engineering, or an industrial process, one is frequently...
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a gen...
AbstractThis paper introduces several strategies to deal with pivot blocks in multi-level block inco...