High Performance Parallel Block Supernode Direct Solver for Stiffness 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
The process of direct method to solve large sparse linear equation mainly includes reordering, symbolic factorization, numerical factorization and triangular solving. Traditional symbolic factorization predicts the pattern of $L$ based on single column and single row index. We propose to directly partition supernodes based on characteristics of matrix reordered by METIS, and then perform parallel symbolic factorization based on supernodes and row index fragments. A parallel block supernode numerical factorization strategy is proposed based on the concept of task pool here. In triangular solving stage, unlike traditional algorithms based on DAXPY and DDOT operations, we propose a new parallel triangular solving algorithm based on DGEMM and DTRSM operations. We name the parallel solver as finite element analysis direct solver (FEADS) and compare it with the advanced MKL PARDISO and MUMPS. The stiffness equations of 394770 and 719871 dimensions are solved using the solvers on two different computers. On the first computer, the solving efficiency of FEADS and MKL PARDISO is comparable, while MUMPS is relatively backward. On the second computer, FEADS performs especially well. For solving the case with 394770 dimensions, FEADS leads MKL PARDISO and MUMPS by 21.92% and 42.35%, respectively. For solving the case with 719871 dimensions, FEADS leads 34.75% and 38.38% respectively.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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