Parallel Computation of a Mixed Convection Problem Using Fully-Coupled and Segregated Algorithms
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 work, parallel solution of the Navier-Stokes equations for a mixed convection heat problem is achieved using a finite-element-based finite-volume method in fully coupled and semi coupled algorithms. A major drawback with the implicit methods is the need for solving the huge set of linear algebraic equations in large scale problems. The current parallel computation is developed on distributed memory machines. The matrix decomposition and solution are carried out using PETSc library. In the fully coupled algorithm, there is a 36-diagonal global matrix for the two-dimensional governing equations. In order to reduce the computational time, the matrix is suitably broken in several sub-matrices and they are subsequently solved in a segregated manner. This approach results in four 9-diagonal matrices. Different sparse solver algorithms are utilized to solve a mixed natural-forced convection problem using either fully-coupled or semi-coupled algorithms. The performance of the solvers are then investigated in solving on a distributed computing environment. The study shows that the iteration run time considerably decreases although the overall run time of the fully coupled algorithm still looks better.
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.000 | 0.000 |
| 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