Parallel Fast Iterative H-Matrix Locally Corrected Nyström Discretization of Integral Equations with an Inaccurate H-matrix Preconditioner
Bibliographic record
Abstract
In this research, a new method is presented for addressing the Combined Field Integral Equation (CFIE) using the Locally Corrected Nyström (LCN) technique, focusing on speed, error control, and parallel processing features of the implementation. The method involves utilizing a less precise preconditioner derived from the coefficient matrix, which accelerates the whole process despite its reduced accuracy. However, this fast approach has some challenges in trading-off between solution speed and accuracy since we are approximating H-LU decomposition as well. This is particularly affecting the residual and precision of the solution when dealing with CFIE problems. The method implemented uses MPI parallelization for coefficient filling, and it uses HLibPro, which is OpenMP parallelized, to construct H-Matrices and perform H-LU factorization. To reach the desired compression, ACA method is used to compress the matrices to the tolerance required. Giving larger tolerance to preconditioner matrix and H-LU factorization, makes the problem hard to converge to the desired accuracy. As a reason, it is necessary always to trade-off between accuracy, the speedup and compression of the matrices. To illustrate its efficacy, consider Nasa Almond with 84,000 unknowns (where $l=240 \mathrm{~m}$) exposed to an z-polarized dipole located in the x direction in the far-field. The operating frequency is set at 3 MHz, with geometric dimensions spanning two wavelengths. As it is shown in Fig. 1, the Compression Rate (CR) achieved for the preconditioner H-matrix is $91.56 \%$, while for the coefficient matrix, it is $85.44 \%$. The relative error of the computational problem, $|A x-b|$, is quantified at $4.1023 \mathrm{e}-09$, which converges in four iterations. Moreover, the CPU time required to build both H-matrices is 9555.36 seconds, while it takes 4130.66 seconds to do H-LU factorization with 40 cores working in parallel.
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 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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".