15 research outputs found

    Fracture roughness in three-dimensional beam lattice systems

    Get PDF
    We study the scaling of three-dimensional crack roughness using large-scale beam lattice systems. Our results for prenotched samples indicate that the crack surface is statistically isotropic, with the implication that experimental findings of anisotropy of fracture surface roughness in directions parallel and perpendicular to crack propagation is not due to the scalar or vectorial elasticity of the model. In contrast to scalar fuse lattices, beam lattice systems do not exhibit anomalous scaling or an extra dependence of roughness on system size. The local and global roughness exponents (ζloc and ζ, respectively) are equal to each other, and the three-dimensional crack roughness exponent is estimated to be ζloc=ζ=0.48±0.03. This closely matches the roughness exponent observed outside the fracture process zone. The probability density distribution p[Δh(ℓ)] of the height differences Δh(ℓ)=[h(x+ℓ)−h(x)] of the crack profile follows a Gaussian distribution, in agreement with experimental results.Peer reviewe

    An Efficient Block Circulant Preconditioner For Simulating Fracture Using Large Fuse Networks

    Full text link
    {\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(rslogs)+delopsO(rs log s) + delops, where the stiffness matrix A{\bf A} is partioned into rr-by-rr blocks such that each block is an ss-by-ss matrix, and delopsdelops represents the operational count associated with solving a block-diagonal matrix with rr-by-rr 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.Comment: 16 pages including 2 figure
    corecore