An efficient block-circulant preconditioner for simulating fracture using large fuse networks
From MaRDI portal
Abstract: {it Critical slowing down} associated with the iterative solvers close to the critical point often hinders large-scale numerical simulation of fracture using discrete lattice networks. This paper presents a block circlant preconditioner for iterative solvers for the simulation of progressive fracture in disordered, quasi-brittle materials using large discrete lattice networks. The average computational cost of the present alorithm per iteration is , where the stiffness matrix is partioned into -by- blocks such that each block is an -by- matrix, and represents the operational count associated with solving a block-diagonal matrix with -by- dense matrix blocks. This algorithm using the block circulant preconditioner is faster than the Fourier accelerated preconditioned conjugate gradient (PCG) algorithm, and alleviates the {it critical slowing down} that is especially severe close to the critical point. Numerical results using random resistor networks substantiate the efficiency of the present algorithm.
Recommendations
- An efficient algorithm for simulating fracture using large fuse networks
- An efficient algorithm for modelling progressive damage accumulation in disordered materials
- Block preconditioning for fault/fracture mechanics saddle-point problems
- Circulant preconditioned iterative methods for peridynamic model simulation
- Preconditioning strategies for vectorial finite element linear systems arising from phase-field models for fracture mechanics
Cited in
(3)
This page was built for publication: An efficient block-circulant preconditioner for simulating fracture using large fuse networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4466290)