Numerical calculation for coupling vibration system by Piecewise-Laplace method
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
To improve the reliability and accuracy of dynamic machine in design process, high precision and efficiency of numerical computation is essential means to identify dynamic characteristics of mechanical system. In this paper, a new computation approach is introduced to improve accuracy and efficiency of computation for coupling vibrating system. The proposed method is a combination of piecewise constant method and Laplace transformation, which is simply called as Piecewise-Laplace method. In the solving process of the proposed method, the dynamic system is first sliced by a series of continuous segments to reserve physical attribute of the original system; Laplace transformation is employed to separate coupling variables in segment system, and solutions of system in complex domain can be determined; then, considering reverse Laplace transformation and residues theorem, solution in time domain can be obtained; finally, semi-analytical solution of system is given based on continuity condition. Through comparison of numerical computation, it can be found that precision and efficiency of numerical results with the Piecewise-Laplace method is better than Runge-Kutta method within same time step. If a high-accuracy solution is required, the Piecewise-Laplace method is more suitable than Runge-Kutta method.
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.
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.000 | 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 it