Blow-up for Discretizations of a Nonlinear Parabolic Equation With Nonlinear Memory and Mixt Boundary Condition
Bibliographic record
Abstract
In this paper, we study the numerical approximation for the following initial-boundary value problem v_t=v_{xx}+v^q\int_{0}^{t}v^p(x,s)ds, x\in(0,1), t\in(0,T) v(0,t)=0, v_x(1,t)=0, t\in(0,T) v(x,0)=v_0(x)>0}, x\in(0,1) where q>1, p>0. Under some assumptions, it is shown that the solution of a semi-discrete form of this problem blows up in the finite time and estimate its semi-discrete blow-up time. We also prove that the semi-discrete blows-up time converges to the real one when the mesh size goes to zero. A similar study has been also undertaken for a discrete form of the above problem. Finally, we give some numerical results to illustrate our analysis.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".