A Macro Finite-Element Formulation for Cardiac Electrophysiology Simulations Using Hybrid Unstructured Grids
Bibliographic record
Abstract
Electrical activity in cardiac tissue can be described by the bidomain equations whose solution for large-scale simulations still remains a computational challenge. Therefore, improvements in the discrete formulation of the problem, which decrease computational and/or memory demands are highly desirable. In this study, we propose a novel technique for computing shape functions of finite elements (FEs). The technique generates macro FEs (MFEs) based on the local decomposition of elements into tetrahedral subelements with linear shape functions. Such an approach necessitates the direct use of hybrid meshes (HMs) composed of different types of elements. MFEs are compared to classic standard FEs with respect to accuracy and RAM memory usage under different scenarios of cardiac modeling, including bidomain and monodomain simulations in 2-D and 3-D for simple and complex tissue geometries. In problems with analytical solutions, MFEs displayed the same numerical accuracy of standard linear triangular and tetrahedral elements. In propagation simulations, conduction velocity and activation times agreed very well with those computed with standard FEs. However, MFEs offer a significant decrease in memory requirements. We conclude that HMs composed of MFEs are well suited for solving problems in cardiac computational electrophysiology.
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.000 | 0.001 |
| 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.001 | 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".