Quarter-Sweep Finite Difference Approximation with Thomas Algorithm for Solving Nonlinear Advection-Diffusion Equation
Bibliographic record
Abstract
Solving nonlinear advection-diffusion equations efficiently is one of the challenging tasks in computational mathematics.These equations are commonly used to model transport phenomena such as fluid flow, heat transfer, and pollutant dispersion.Finite difference methods are widely applied for solving these equations.However, their application in multi-dimensional mathematical problems involves high computational complexity.To address this issue, this paper investigates the computational efficiency of the quarter-sweep finite difference approximation combined with the Thomas algorithm.The proposed numerical method utilises the quarter-sweep strategy to significantly reduce the number of computations required per iteration while maintaining numerical accuracy.Through extensive numerical experiments, the computational performance of the proposed method is carefully assessed by comparing it with the standard implicit finite difference method.The experimental results show that the proposed numerical method achieves higher computational efficiency while maintaining comparable numerical accuracy when it is compared to the standard implicit finite difference method.The reduction in computational load makes the proposed method particularly beneficial for large-scale simulations.The contribution of this research is the integration of the quarter-sweep strategy with the Thomas algorithm which offers an alternative numerical solution strategy for solving nonlinear advection-diffusion equations.This research has potential implications in fields such as fluid dynamics, environmental modelling, and engineering applications.Despite its advantages, this research is limited to one-dimensional problems.Future work will focus on extending the numerical solution strategy to higher-dimensional problems.The findings of this research contribute to the ongoing efforts in developing efficient and scalable numerical methods for solving nonlinear partial differential equations.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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.002 | 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".