A parallel iterative algorithm is described for efficient solution of the Schur complement (interface) problem arising in the domain decomposition of stochastic partial differential equations (SPDEs) recently introduced in [1,2]. The iterative solver avoids the explicit construction of both local and global Schur complement matrices. An analog of Neumann-Neumann domain decomposition preconditioner is introduced for SPDEs. For efficient memory usage and minimum floating point operation, the numerical implementation of the algorithm exploits the multilevel sparsity structure of the coefficient matrix of the stochastic system. The algorithm is implemented using PETSc parallel libraries. Parallel graph partitioning tool ParMETIS is used for optimal decomposition of the finite element mesh for load balancing and minimum interprocessor communication. For numerical demonstration, a two dimensional elliptic SPDE with non-Gaussian random coefficients is tackled. The strong and weak scalability of the algorithm is investigated using Linux cluster.

Additional Metadata
Keywords Domain decomposition method, Neumann-Neumann preconditioner, Polynomial chaos expansion, Schur complement system, Stochastic PDEs
Persistent URL dx.doi.org/10.1007/978-3-642-12659-8_19
Series Lecture Notes in Computer Science
Subber, W. (Waad), & Sarkar, A. (2010). Domain decomposition of stochastic PDEs: A novel preconditioner and its parallel performance. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-12659-8_19