An efficient algorithm for simulating fracture using large fuse networks

DOI10.1088/0305-4470/36/45/004zbMATH Open1138.74384arXivcond-mat/0503719OpenAlexW1972969794MaRDI QIDQ4467490FDOQ4467490

Authors: Phani Kumar V. V. Nukala, S. Simunovic 

Publication date: 10 June 2004

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: The high computational cost involved in modeling of the progressive fracture simulations using large discrete lattice networks stems from the requirement to solve {it a new large set of linear equations} every time a new lattice bond is broken. To address this problem, we propose an algorithm that combines the multiple-rank sparse Cholesky downdating algorithm with the rank-p inverse updating algorithm based on the Sherman-Morrison-Woodbury formula for the simulation of progressive fracture in disordered quasi-brittle materials using discrete lattice networks. Using the present algorithm, the computational complexity of solving the new set of linear equations after breaking a bond reduces to the same order as that of a simple {it backsolve} (forward elimination and backward substitution) {it using the already LU factored matrix}. That is, the computational cost is $$, where $$ denotes the number of non-zeros of the Cholesky factorization $$ of the stiffness matrix $$. This algorithm using the direct sparse solver is faster than the Fourier accelerated preconditioned conjugate gradient (PCG) iterative solvers, and eliminates the {it critical slowing down} associated with the iterative solvers that is especially severe close to the critical points. Numerical results using random resistor networks substantiate the efficiency of the present algorithm.

Full work available at URL: https://arxiv.org/abs/cond-mat/0503719

Recommendations

• An efficient block-circulant preconditioner for simulating fracture using large fuse networks
• An optimization approach for large scale simulations of discrete fracture network flows
• The virtual element method for discrete fracture network simulations
• scientific article; zbMATH DE number 2210639
• FraC: a new conforming mesh method for discrete fracture networks
• An efficient algorithm for propagating fluid-driven fractures
• Fast and robust flow simulations in discrete fracture networks with gpgpus

Mathematics Subject Classification ID

Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Brittle fracture (74R10)

Cited In (5)

• An efficient block-circulant preconditioner for simulating fracture using large fuse networks
• Anomalous roughness of fracture surfaces in 2D fuse models
• Fracture statistics in the three-dimensional random fuse model
• Fracture and fragmentation of simplicial finite element meshes using graphs
• An efficient algorithm for modelling progressive damage accumulation in disordered materials

This page was built for publication: An efficient algorithm 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 Q4467490)