Group-random algorithm to generate representative volume element models for composites
Bibliographic record
Abstract
One of the most commonly used methods for characterizing the mechanical properties of discontinuous fiber reinforced composites (DFRC) is to establish a Representative Volume Element (RVE) model and perform finite element (FE) analysis. However, FE analysis on RVE models established by traditional sampling algorithms is often computationally expensive due to the large size of RVE that is required to be statistically representative of the composite. To address this issue, this paper proposes a new approach for constructing RVE models with more accurate description of fiber orientation, aiming to make the FE modelling more efficient by using an RVE with small size. When establishing RVE models with given target fiber orientation tensor, it is very challenging to accurately capture the orientation of fibers. In order to mitigate the error between the orientation tensor reconstructed by fibers generated in the RVE and the target orientation tensor, a group-random algorithm is proposed in the current work to generate RVE models. Unlike the traditional algorithm, in which fibers are sampled one by one in the RVE, the group-random algorithm samples a group of four fibers at one time in order to eliminate the error of the off-diagonal components of the reconstructed orientation tensor in the principal coordinate system. Then a modification tensor is further introduced to mitigate the error of the diagonal components of the reconstructed orientation tensor. Simulation results show that the orientation tensor error could be significantly reduced by the group-random algorithm even for the RVE with low number of fibers. The merits of the group-random algorithm are also witnessed by the stability and accuracy of predicting the elastic constants of composite materials through RVE modeling. It is thus concluded that the major advantage of this work is to provide an alternatively feasible strategy to substantially improve computational efficiency of RVE modelling.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".