A computationally efficient implementation of a full and reduced-order electrochemistry-based model for Li-ion batteries
Bibliographic record
Abstract
Lithium-ion batteries are commonly employed in various applications owing to high energy density and long service life. Lithium-ion battery models are used for analysing batteries and enabling power control in applications. The Doyle-Fuller-Newman (DFN) model is a popular electrochemistry-based lithium-ion battery model which represents solid-state and electrolyte diffusion dynamics and accurately predicts the current/voltage response using a set of nonlinear partial differential equations. However, implementation of the full DFN model requires significant computation time. This paper proposes a computationally efficient implementation of the full DFN battery model, which is convenient for real-time applications. The proposed implementation is based on applying model order reduction to a spatial and temporal discretisation of the governing model equations. For model order reduction, we apply proper orthogonal decomposition and discrete empirical interpolation method, which leads to a set of reduced order nonlinear algebraic equations. These equations are solved using a particular numerical scheme, based on a damped Newton’s method. In a simulation study, the computational efficiency of the proposed implementation is shown and the resulting accuracy is 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".