MétaCan
Menu
Back to cohort

Parallel Fast Iterative H-Matrix Locally Corrected Nyström Discretization of Integral Equations with an Inaccurate H-matrix Preconditioner

2024· article· en· W4403210819 on OpenAlexaff
Omid Babazadeh, Jin Hu, Emrah Sever, Ian Jeffrey, Constantine Sideris, Vladimir Okhmatovski

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsPreconditionerDiscretizationMatrix (chemical analysis)Iterative methodIntegral equationMathematicsApplied mathematicsMathematical analysisMathematical optimizationMaterials science

Abstract

fetched live from OpenAlex

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 machine prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

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.

Opus teacher head0.011
GPT teacher head0.276
Teacher spread0.265 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicMatrix Theory and AlgorithmsFrench-language works237,207