SOME A PRIORI ERROR ESTIMATES FOR FINITE ELEMENT APPROXIMATIONS OF ELLIPTIC AND PARABOLIC LINEAR STOCHASTIC PARTIAL DIFFERENTIAL EQUATIONS
Bibliographic record
Abstract
We study some theoretical aspects of Legendre polynomial chaos based finite element approximations of elliptic and parabolic linear stochastic partial differential equations (SPDEs) and provide a priori error estimates in tensor product Sobolev spaces that hold under appropriate regularity assumptions.Our analysis takes place in the setting of finitedimensional noise, where the SPDE coefficients depend on a finite number of second-order random variables.We first derive a priori error estimates for finite element approximations of a class of linear elliptic SPDEs.Subsequently, we consider finite element approximations of parabolic SPDEs coupled with a θ-weighted temporal discretization scheme.We establish conditions under which the time-stepping scheme is stable and derive a priori rates of convergence as a function of spatial, temporal, and stochastic discretization parameters.We later consider steady-state and time-dependent stochastic diffusion equations and illustrate how the general results provided here can be applied to specific SPDE models.Finally, we theoretically analyze primal and adjoint-based recovery of stochastic linear output functionals that depend on the solution of elliptic SPDEs and show that these schemes are superconvergent.
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.006 | 0.018 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.001 | 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".