Accelerated Computation of Large-Order and Nonlinear Finite Element Models
Bibliographic record
Abstract
In this paper, we discuss a physics-based framework for accelerated computation of large-order linear and nonlinear finite element models. We utilize the word physics-based to differentiate from accelerated computation achieved via other means such as neural networks. The typical manner in which system-level finite element models are developed is by first constructing the sub-system level (hereafter referred to as component) finite element models and then imposing constraint equations along the connecting interfaces to impose displacement compatibility and force equilibrium. In this way, the finite element model of large complex systems can be constructed from its components in a systematic fashion. The resulting system-level finite element model will often be of large-order (100M+ degrees of freedoms) especially if high resolution stress calculations are desired. The solution of such large-order finite element models in either frequency- or time-domain can easily become infeasible even on cloud-based super-computers. However, high-speed computation can still be achieved algorithmically with a proper framework for computation. By utilizing methodologies such as Residual-Flexibility Mixed-Boundary (RFMB), reduced-order component level models which fully preserve the accuracy of the upstream component finite element model can be developed. From these reduced-order components, the system-level model can be constructed which can now compute any desired forcing function for the subject assessment, including long duration stochastics inputs. The deployment of this methodology and framework are demonstrated through application examples, which include irregular wave fatigue of flexible risers, dynamics of a floating structure topside/hull, random vibrations of cokers, and stresses in thermoplastic composite pipe.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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".