Forward modeling of direct-current resistivity data on unstructured grids using an adaptive mimetic finite-difference method
Bibliographic record
Abstract
ABSTRACT An effective solver for the direct-current (DC) resistivity forward-modeling problem should be capable of accommodating arbitrary electrode layouts, adapting the mesh to topography and complex geologic structures, and adaptively refining the mesh to ensure high solution accuracy. We use the capability of the mimetic finite-difference method in naturally accommodating meshes with nonconforming elements to develop adaptive and parallel cell-based (CB) and vertex-based (VB) mimetic schemes for the forward modeling of DC resistivity data on unstructured meshes. A diffusion problem in mixed form and Poisson’s problem are solved in the CB and VB schemes, respectively. The mesh adaptivity involves an iterative h-refinement conducted by a regular subdivision of the marked elements together with a 2-irregularity condition. Goal-oriented residual- and gradient-based error estimators are used to mark the elements for refinement in the CB and VB schemes, respectively. To evaluate the accuracy and efficiency of the mimetic schemes, we use two benchmark models with analytical solutions and standard linear and quadratic finite-element solutions. The numerical results for apparent resistivity from both mimetic schemes accurately approximate the reference analytical and numerical values. Furthermore, on similar meshes, the VB mimetic scheme is found to be less demanding than the CB method in terms of computational resource requirement. We also develop a grid-based mesh generation technique based on the body-centered cubic lattice to generate high-quality initial meshes. Using benchmark examples, we validate this mesh generation method and demonstrate its versatility by discretizing a model of a thin dike where a standard Delaunay mesh generator fails to generate a mesh. Moreover, we display the effectiveness of the presented mimetic approach and the grid-based mesh generation technique using a realistic example with topography and parallelization over a large number of sources.
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.001 | 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.000 |
| Open science | 0.001 | 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".