arXiv · cond-mat/0503722
An Efficient Block Circulant Preconditioner For Simulating Fracture Using Large Fuse Networks
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 $O(rs log s) + delops$, where the stiffness matrix ${\bf A}$ is partioned into $r$-by-$r$ blocks such that each block is an $s$-by-$s$ matrix, and $delops$ represents the operational count associated with solving a block-diagonal matrix with $r$-by-$r$ 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Phani Kumar V. V. Nukala, Srdjan Simunovic. 2005-03-30. An Efficient Block Circulant Preconditioner For Simulating Fracture Using Large Fuse Networks. https://doi.org/10.1088/0305-4470%2F37%2F6%2F009
Cite the original work for its findings. Save a collection to share your selection of sources.