Parallel Computation of Meshfree Methods for Extremely Large Deformation Analysis
Bibliographic record
Abstract
Due to the heavier computation requirement than other competitive techniques and the essence of applications that are usually highly complex and computationally intensive,parallel computing is especially attractive for these meshfree methods.The paper focused on discussion the Reproducing Kernel Particle Method(RKPM),one of the meshfree methods for large strain elasto-plastic analysis of solid and structures,in considering with its ability to accurately model extremely large deformations without mesh distortion problems,and its ease of adaptive modeling by simply changing particle definitions for desired refinement regions.The parallel procedure primarily consists of a mesh partitioning pre-analysis phase and parallel computing which includes explicit message passing among partitions on individual processors;with redefinition techniques applied to the shared zones of different geometrical parts,the graph-based procedure Metis,which is quite popular for mesh-based analysis,is used for partitioning in this meshfree analysis.Parallel simulations have been conducted on an SGI Onyx3900 supercomputer with MPI message passing statements.The effectiveness and performance with different partitions has then been compared,and a comparison of the meshfree method with finite element methods is also presented.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 source (direct Gemma or distilled Codex), 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".