Preconditioning by incomplete block cyclic reduction

Journal Article · Sat Mar 31 23:00:00 EST 1984 · Math. Comput.; (United States)

DOI:https://doi.org/10.1090/S0025-5718-1984-0736452-6· OSTI ID:6209063

Rodrigue, G; Wolitzer, D

Iterative methods for solving linear systems arising from the discretization of elliptic/parabolic partial differential equations require the use of preconditioners 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 vector 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: Santa Barbara Research Center, Goleta, California 93117
• DOE Contract Number: W-7405-ENG-48
• OSTI ID: 6209063
• Journal Information: Math. Comput.; (United States), Journal Name: Math. Comput.; (United States) Vol. 42:166; ISSN MCMPA
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
DIFFERENTIAL EQUATIONS
EQUATIONS
FACTORIZATION
ITERATIVE METHODS
MATHEMATICAL LOGIC
MATRICES
PARTIAL DIFFERENTIAL EQUATIONS