A New Computational Method Based on the Method of Lines and Adomian Decomposition Method for Burgers' Equation and Coupled System of Burgers' Equations
Bibliographic record
Abstract
This study proposes a new computational scheme for the solution of the class of one-dimensional Burgers’ equations, comprising mainly the classical Burgers’ equation, and the system of coupled Burgers’ equations. This method is based upon coupling the Method of Lines (MOL) and the prominent Adomian Decomposition Method (ADM) for the reliable computational examination of dissimilar initial-boundary value problems of Burgers’ equations. Certainly, MOL helps with the spatial semi-discretization of the governing problem to a system of nonlinear Ordinary Differential Equations (ODEs); while the ADM contributes to the efficient semi-analytical solution of the resulting nonlinear ODEs. Moreover, the computational accuracy of the new approach has been demonstrated on certain test models and further evaluated using L2 and L∞ norms. Indeed, the method produces better results with minimal errors than many existing computational approaches as successfully reported in various supportive figures and tables.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| 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.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".