DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/20284
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSingh, Navin-
dc.date.accessioned2025-12-02T04:16:16Z-
dc.date.available2025-12-02T04:16:16Z-
dc.date.issued2026-03-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0997753825003286?via%3Dihub-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/20284-
dc.description.abstractWe study the progressive degradation of disordered systems that experience multiple intermediate failures and equilibrations before collapsing while sharing a common resource. The system is modelled using a generalized Fibre Bundle framework, wherein individual elements fail upon exceeding their local thresholds, and their load is redistributed among surviving elements according to a prescribed load-sharing scheme. We employ two classes of disorder distributions: the two-parameter Weibull and a more flexible custom distribution. To predict the ultimate tensile strength (UTS) and critical burst size which characterize system failure in this model—we employ Artificial Neural Networks (ANNs) informed by theoretical expressions rooted in statistical physics. Our investigation shows that the predictive performance of ANNs is significantly improved (from 83% to 99%) by our Physics informed theoretical predictors. This approach reduces the need for large-scale simulations and is a more efficient way to estimate the reliability of such complex disordered systems.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectPhysicsen_US
dc.subjectFractureen_US
dc.subjectFibre bundleen_US
dc.subjectDisordered systemsen_US
dc.subjectNeural networksen_US
dc.titlePhysics-informed failure prediction in disordered systems sharing a common resourceen_US
dc.typeArticleen_US
Appears in Collections:Department of Physics

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.