An Efficient Numerical Technique for Solving the Korteweg-de Vries-Burgers Equation
Bibliographic record
Abstract
Nonlinear partial differential equations, such as the Korteweg-de Vries-Burgers equation (KDVB), receive extensive study in a multitude of fields of engineering and physics. This study presents the Variational Homotopy Perturbation Method (VHPM) as a robust numerical technique for approximating solutions to the KDVB equation. The technique integrates the Variational Iteration Method (VIM) with the Homotopy Perturbation Method (HPM), providing an efficient solution without requiring the discretization or linearization of the equation. The efficacy of the proposed scheme is demonstrated through various problems, with the accuracy of the method being assessed using absolute errors in the and error norms. The results indicate that the proposed method is straightforward to implement and provides superior outcomes compared to the existing schemes documented in the literature. This study offers a substantial contribution to the advancement of numerical techniques for solving nonlinear partial differential equations, providing beneficial applications across diverse scientific and engineering fields.
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 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.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.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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".