Preliminary Application of Software Package GPPS to Spare Linear Systems from Meso Scale Simulation of Concrete Specimen

Article Preview

Abstract:

The general parallel preconditioning subspace iteration software GPPS is developed based on the integration of various preconditioning methods, parallelization techniques, and subspace iterations, to solve general sparse linear systems. The software has several characteristics, including high computational performance, good readability, simple interface, and excellent scalability. In this paper, the functions of the software are outlined, and then it is used to solve the sparse linear systems from meso-scale simulation of concrete specimens. The numerical experiments show that GPPS is clearly superior to the software package AZTEC, which is used in the simulation up to now, and in addition, ICT and the parallelization technique based on factors combination outperform other preconditioning techniques integrated in the software.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2907-2911

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Y. Saad. Iterative Methods for Sparse Linear Systems. PWS, Boston, (1996).

Google Scholar

[2] J. P. Wu, X. P. Liu, Z. H. Wang, Z. H. Dai, and X. M. Li, Two new preprocessing methods to 2-dimension energy equations with three temperatures, Chinese J. Comput. Phys., 2005, 22(4): 283–291.

Google Scholar

[3] Wu Jianping, Wang Zhenghua, Li Xiaomei. Problems and improvements to the incomplete Cholesky decomposition with thresholds. Journal on Numerical Methods and Computer Applications, 2003, 24(3): 207-214.

Google Scholar

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

DOI: 10.1080/10618569908940835

Google Scholar

[5] M. M. monga Made, H. A. van der Vorst. Parallel incomplete factorizations with pseudo-overlapped subdomains. Parallel Computing, 2001, 27: 989-1008.

DOI: 10.1016/s0167-8191(01)00082-5

Google Scholar

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

DOI: 10.1016/j.laa.2003.10.022

Google Scholar

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

DOI: 10.1137/s106482759732678x

Google Scholar

[8] Jianping Wu, Jun Zhao, Junqiang Song, and Xiaomei Li. A parallelization technique based on factor combination and graph partitioning for general incomplete LU factorization. SIAM J. Sci. Comput., 2012, 34(4): A2247–A2266.

DOI: 10.1137/100793244

Google Scholar