Preconditioning by incomplete block cyclic reduction
Technical Report
·
OSTI ID:7076705
Iterative methods for solving linear systems arising from the discretization of elliptic/parabolic partial differential equations require the use of pre-conditioners to gain increased rates of convergence. Preconditioners arising from incomplete factorizations have been shown to be very effective. However, the recursiveness of these methods can offset these gains somewhat on a parallel processor. In this paper, an incomplete factorization based on block cyclic reduction is developed. It is shown that under block diagonal dominance conditions the off-diagonal terms decay quadratically, yielding more effective algorithms.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 7076705
- Report Number(s):
- UCID-19502; ON: DE82021946
- Country of Publication:
- United States
- Language:
- English
Similar Records
Preconditioning by incomplete block cyclic reduction
Incomplete block cyclic reduction
Incomplete block cyclic reduction
Journal Article
·
Sat Mar 31 23:00:00 EST 1984
· Math. Comput.; (United States)
·
OSTI ID:6209063
Incomplete block cyclic reduction
Conference
·
Thu Dec 31 23:00:00 EST 1981
·
OSTI ID:5221509
Incomplete block cyclic reduction
Conference
·
Thu Apr 16 23:00:00 EST 1981
·
OSTI ID:6217579