Finite-Difference Relaxation for Parallel Computation of Ionized Field of HVDC Lines
Bibliographic record
Abstract
Ionized field calculations for high-voltage direct current (HVDC) transmission line is a computationally demanding problem, which can benefit from the application of massively parallel high-performance compute architectures. The finite element method (FEM) commonly employed to solve this problem is both memory and execution time intensive. In this paper, a finite-difference relaxation (FDR) method is proposed to solve a unipolar and a bipolar ionized field problem in an HVDC line. The novel FDR method has several advantages over FEM. First, the scheme is suitable for massively parallel computation and runs much faster: Compared with the commercial FEM software Comsol Multiphysics, the speed-up is more than 14 times in CPU parallelization and 35 times in graphics processor parallel implementation, while providing high accuracy. Moreover, the set of equations in FDR need not be assembled; instead, it is solved by a relaxation scheme and requires much less memory than FEM. Additionally, differentiated grid size with interpolation techniques is proposed to improve the flexibility of FDR for problem domain containing irregular geometries or disproportional sizes.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".