Using Quasi-linearization for Real Time Dynamic Simulation of a Quarter Vehicle Suspension
Bibliographic record
Abstract
Real time dynamic simulation of mechanisms with kinematically closed loops requires solving systems of nonlinear differential algebraic equations (DAE). Examples of such mechanisms are racing car suspensions and certain robotic arms. Simulating such systems in real time requires significant computational power. This paper explores an alternative approach in an attempt to minimize computational effort. A hybrid, two-step approach is employed of first applying symbolic math methods followed by numerical simulation. Explored is the possibility of optimizing formulae and precalculating coefficients to speed up real time simulation. Quasi-linearization is suggested as a method of solving and simulating nonlinear DAE in real time. The equations of motion are linearized in every point of the state space. The result is a system of linear ordinary differential equations with varying coefficients. These coefficients are functions of the simulated system state space (positions and their first derivatives). A symbolic math package - Mathematica™ - is used to derive and simplify the varying coefficients. The derived coefficient functions and ordinary differential equations are simulated numerically by a Simulink™ model. Real time simulation is performed with C code generated from the Simulink™ model. To achieve maximum simulation speed, the paper explores precalculating the varying coefficients in lookup tables. The outlined process was applied to the simulation of a quarter car double wishbone suspension. The quasi-linearization approach provided numerically exact solutions for both small and large signal amplitudes. A vital requirement for successful simulation proved to be the selection of states to be actual physical values (positions of parts, and their derivatives). The validity of solutions was checked against iterative solution as well as standard linearized model.
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.000 | 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.003 | 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".