Efficient and accurate finite difference schemes for solving one-dimensional Burgers’ equation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, two efficient fourth-order compact finite difference algorithms have been developed to solve the one-dimensional Burgers’ equation: u t +u u x =ε u xx . The methods are based on the Hopf–Cole transformation, Richardson's extrapolation, and multilevel grids. In both methods, we first transform the original nonlinear Burgers’ equation into a linear heat equation: w t =ε w xx using the Hopf–Cole transformation, which is given as u=−2ε (w x /w). In the first method, the resulted heat equation is solved by the second-order accurate Crank–Nicholson algorithm while w x is approximated by central finite difference, which is also second-order accurate. Richardson's extrapolation technique is then applied in both time and space to obtain fourth-order accuracy. In the second method, to reduce the cancellation error in approximating w x , we derive the heat equation satisfied by w x , which is then solved by the Crank–Nicholson algorithm. The original Dirichlet boundary condition is transformed into the Robin boundary condition, which is also approximated using second-order central finite difference. Finally, Richardson's extrapolation and multilevel grid techniques are applied in both time and space to obtain fourth-order accuracy. To study the efficiency, accuracy and robustness, we solved two numerical examples and the results are compared with those of two other higher-order methods proposed in W. Liao [An implicit fourth-order compact finite difference scheme for one-dimensional Burgers’ equation, Appl. Math. Comput. 206(2) (2008), pp. 755–764] and I.A. Hassanien, A.A. Salama, and H.A. Hosham [Fourth-order finite difference method for solving Burgers’ equation, Appl. Math. Comput. 170 (2005), pp. 781–800].
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.
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.001 | 0.001 |
| 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 it