
doi: 10.4203/ccp.94.33
handle: 11368/2950255 , 11577/2420209
In this paper we propose and describe a parallel implementation of a block preconditioner in the solution of saddle point linear systems arising from Finite Element (FE) discretization of 3D coupled consolidation problems. The inexact constraint preconditioner recently developed is combined with the parallel FSAI preconditioner which is used here to approximate both the structural (1,1) block and the Schur complement matrix. The resulting preconditioner proves effective in the acceleration of the BiCGSTAB iterative solver. Numerical results on a number of test cases of size up to 2×106 unknowns and 1.2×108 nonzeros show the perfect scalability of the overall code up to 256 processors. The proposed iterative method is shown to outperform the well-established pARMS multilevel solver on the largest problem.
krylov subspaces methods; coupled consolidation; parallel computer; preconditioning, parallel computer, preconditioning, coupled consolidation, krylov subspaces method
krylov subspaces methods; coupled consolidation; parallel computer; preconditioning, parallel computer, preconditioning, coupled consolidation, krylov subspaces method
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
