TY - GEN
T1 - Comparison of some domain decomposition algorithms for nonsymmetric elliptic problems
AU - Cai, Xiao Chuan
AU - Gropp, William D.
AU - Keyes, David E.
PY - 1992
Y1 - 1992
N2 - In recent years, competitive domain-decomposed preconditioned iterative techniques have been developed for nonsymmetric elliptic problems. In these techniques, a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow effective solution on parallel machines. Central questions are how to choose these small problems and how to arrange the order of their solution. Different specifications of decomposition and solution order lead to a plethora of algorithms possessing complementary advantages and disadvantages. In this report we compare several methods, including the additive Schwarz algorithm, the multiplicative Schwarz algorithm, the tile algorithm, the CGK and CSPD algorithms, and the popular global ILU-family of preconditioners, on some nonsymmetric and/or indefinite elliptic model problems discretized by finite difference methods. The preconditioned problems are solved by the unrestarted GMRES method.
AB - In recent years, competitive domain-decomposed preconditioned iterative techniques have been developed for nonsymmetric elliptic problems. In these techniques, a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow effective solution on parallel machines. Central questions are how to choose these small problems and how to arrange the order of their solution. Different specifications of decomposition and solution order lead to a plethora of algorithms possessing complementary advantages and disadvantages. In this report we compare several methods, including the additive Schwarz algorithm, the multiplicative Schwarz algorithm, the tile algorithm, the CGK and CSPD algorithms, and the popular global ILU-family of preconditioners, on some nonsymmetric and/or indefinite elliptic model problems discretized by finite difference methods. The preconditioned problems are solved by the unrestarted GMRES method.
UR - http://www.scopus.com/inward/record.url?scp=0026976848&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026976848&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0026976848
SN - 0898712882
T3 - Domain Decomposition Methods for Partial Differential Equations
SP - 224
EP - 235
BT - Domain Decomposition Methods for Partial Differential Equations
PB - Publ by Soc for Industrial & Applied Mathematics Publ
T2 - Fifth International Symposium on Domain Decomposition Methods for Partial Differential Equations
Y2 - 6 May 1991 through 8 May 1991
ER -