This paper presents a class of preconditioners for sparse systems arising from discretized partial differential equations (PDEs). In this class of preconditioners, we exploit the multilevel sequentially semiseparable (MSSS) structure of the system matrix. The off-diagonal blocks of MSSS matrices are of low-rank, which enables fast computations of linear complexity. In order to keep the low-rank property of the off-diagonal blocks, model reduction algorithm is necessary. We tested our preconditioners for 2D convection-diffusion equation, the computational results show the excellent performance of this approach
. For a sparse linear system Ax = b, preconditioners of the form C = D + L + U , where D is the blo...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
A popular class of preconditioners is known as incomplete factorizations. They can be thought of as ...
This paper studies a new preconditioning technique for sparse systems arising from discretized par-t...
This paper studies a new preconditioning technique for sparse systems arising from discretized parti...
In this paper, we consider preconditioning for PDE-constrained optimization problems. The underlying...
This paper studies a new preconditioning technique for sparse systems arising from discretized parti...
This paper studies a new preconditioning technique for sparse systems arising from discretized parti...
AbstractWe develop in this paper a multilevel block ILU preconditioner for solving sparse nonsymmetr...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
To precondition large sparse linear systems resulting from the discretization of second-order ellipt...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
. For a sparse linear system Ax = b, preconditioners of the form C = D + L + U , where D is the blo...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
A popular class of preconditioners is known as incomplete factorizations. They can be thought of as ...
This paper studies a new preconditioning technique for sparse systems arising from discretized par-t...
This paper studies a new preconditioning technique for sparse systems arising from discretized parti...
In this paper, we consider preconditioning for PDE-constrained optimization problems. The underlying...
This paper studies a new preconditioning technique for sparse systems arising from discretized parti...
This paper studies a new preconditioning technique for sparse systems arising from discretized parti...
AbstractWe develop in this paper a multilevel block ILU preconditioner for solving sparse nonsymmetr...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
To precondition large sparse linear systems resulting from the discretization of second-order ellipt...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
. For a sparse linear system Ax = b, preconditioners of the form C = D + L + U , where D is the blo...
In this work we introduce a new two-level preconditioner for the efficient solution of large-scale l...
A popular class of preconditioners is known as incomplete factorizations. They can be thought of as ...