Low Rank Off-diagonal Block Preconditioners for Solving Sparse Linear Systems on Parallel Computers

@inproceedings{Bramley1996LowRO,
title={Low Rank Off-diagonal Block Preconditioners for Solving Sparse Linear Systems on Parallel Computers},
author={Randall Bramley},
year={1996}
}

For a sparse linear system Ax = b, preconditioners of the form C = D + L+ U , where D is the block diagonal part of A (or incomplete factorization approximation of its blocks), and L and U are block strictly lower and upper triangular matrices composed of low-ranks approximations of the respective blocks of A, are examined. C is applied directly, by solving Cz = w, or partially, by applying one step of BSSOR to Cz = w. Use of low-rank approximations of o -diagonal blocks is common in dense… CONTINUE READING