A Coarse Grid Correction to Domain Decomposition Based Preconditioners for Meso-Scale Simulation of Concrete

Article Preview

Abstract:

Meso-scale simulation is one of the important ways to study dynamic behaviors of concrete materials, while most of the simulation time is used to solve the sparse linear systems. Because the discrete grid is three dimensional and is of large scale, iterations are the best solutions. But the convergence depends on the distribution of the eigenvalues of the coefficient matrix, to make the eigenvalues distributed more closely each other, it is required to adopt preconditioning techniques. In this paper, with the characteristics of the sparse linear systems considered, there provides a coarse grid correction algorithm, which is based on domain decomposition preconditioners and aggregation of sub-domains, with each aggregated into a single super-node. A linear system with small scale size is formed, which contains the global information and the solution is used to correct the solution components of the original auxiliary linear system. For incomplete factorization preconditioner parallelized with block Jacobi, classic additive Schwarz, and factors combination techniques, the experiments show that the presented algorithm can improve the convergence rate and the efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

4683-4687

Citation:

Online since:

October 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ma Huaifa, Chen Houqun, Study on Dynamic Damage Mechanism of Full-graded Dam Concrete and its Meso-scale Mechanics Analysis, China WaterPower Press, Beijing, (2008).

Google Scholar

[2] Wu Jian-ping, Zhao Jun, Song Jun-qiang, Li Xiao-mei, Impact of two factors on several domain decomposition based parallel incomplete factorizations for the meso-scale simulation of concrete, The Third International Conference on Information and Computing Science(ICIC2010), IEEE Press, Jun. 2010, pp.346-349.

DOI: 10.1109/icic.2010.146

Google Scholar

[3] K. Nakajima, H. Okuda, Parallel Iterative Solvers with Localized ILU Preconditioning for Unstructured Grids on Workstation Clusters, International Journal of Computational Fluid Dynamics, Vol. 12, No. 3/4, 1999, pp.315-322.

DOI: 10.1080/10618569908940835

Google Scholar

[4] J. Zhang, On preconditioning Schur complement and Schur complement preconditioning, Electronic Transactions on Numerical Analysis, No. 10, 2000, pp.115-130.

Google Scholar

[5] R. Bru, F. Pedroche, D. B. Szyld, Overlapping Additive and Multiplicative Schwarz Iterations for H-matrices, Linear Algebra and its Applications, No. 393, 2004, p.91–105.

DOI: 10.1016/j.laa.2003.10.022

Google Scholar

[6] R. E. White, Multisplitting with different weighting schemes, SIAM J. Matrix Anal. Appl., Vol. 10, No. 4, 1989, pp.481-493.

DOI: 10.1137/0610034

Google Scholar

[7] X. -C. Cai, M. Sarkis, A restricted additive Schwarz preconditioner for general sparse linear systems, SIAM J. Sci. Comput., No. 21, 1999, pp.792-797.

DOI: 10.1137/s106482759732678x

Google Scholar

[8] Wu Jianping, Song Junqiang, Zhang Wei-min, Li Xiaomei, A Parallelization Method to Incomplete Factorization Preconditioning of Block Tridiagonal Linear Systems Based on 2-D Domain Decomposition, Chinese J. Computational Physics, Vol. 26, No. 1, 2009, pp.149-155.

Google Scholar

[9] Wu Jianping, Wang Zhenghua, Li Xiaomei, Problems and Improvements to the Incomplete Cholesky Decomposition with Thresholds, Journal on Numerical Methods and Computer Applications, Vol. 24, No. 3, 2003, pp.207-214.

Google Scholar