Computation of empirical eigenfunctions of parabolic PDEs with non-trivial time-varying domain
Bibliographic record
Abstract
In this article, a methodology to compute the empirical eigenfunctions for the order-reduction of parabolic partial differential equation (PDE) systems with time-varying domain is explored. In this method, a mapping functional is obtained, which relates the time-evolution of the solution of parabolic PDE with the time-varying domain to a fixed reference domain, while preserving space invariant properties of the raw solution ensemble. Subsequently, the Karhunen-Lòeve decomposition is applied to the solution ensemble with fixed spatial domain resulting in a set of optimal eigenfunctions that capture the most energy of data. Further, the low dimensional set of empirical eigenfunctions is mapped (“pushed-back”) on the original time-varying domain by an appropriate mapping resulting in the basis for the construction of the reduced-order model of the parabolic PDE system with time-varying domain. Finally, this methodology is used for the order-reduction of the Czochralski crystal growth process model which is a two dimensional parabolic PDE system on a time-varying domain with non-trivial geometry. The transformations which relate the raw data on the time-varying and time-invariant domains are designed to preserve dynamic features of the scalar physical property and comparisons among reduced and high order fidelity models are provided.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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.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".