pith. sign in

arxiv: 2605.16564 · v1 · pith:3LNA6NI5new · submitted 2026-05-15 · 🧮 math.NA · cs.NA

A Parallel and Adaptive Mesh-Free method for Heterogeneous Porous Media

Pith reviewed 2026-05-19 21:21 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords mesh-free methodsradial basis functionsShepard normalizationporous mediapermeability fieldsadaptive refinementsparse regressionparallel computation
0
0 comments X

The pith

Normalized radial basis functions with Shepard stabilization approximate discontinuous step functions to arbitrarily small L1 error.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a Parallel and Adaptive Mesh-Free Approximation (PAM) framework that converts mesh-dependent discontinuous data, such as permeability fields in heterogeneous porous media, into continuous closed-form functions that remain consistent across different discretizations. Radial basis functions combined with Shepard normalization capture sharp interfaces while sparse regression automatically selects relevant basis functions and adaptive refinement targets regions of rapid variation. A theoretical analysis proves that the normalized RBF approach can drive the L1 error arbitrarily small when approximating discontinuous step functions. Domain partitioning enables independent parallel solves on subdomains to scale the reconstruction efficiently. This removes the need for repeated interpolation when transferring material properties between grids.

Core claim

The proposed normalized RBF framework, incorporating Shepard normalization and sparse regression, achieves arbitrarily small L1 error in approximating discontinuous step functions and supplies a continuous closed-form representation of originally piecewise-constant mesh-dependent data while preserving sharp interface features through parallel adaptive subdomain reconstruction.

What carries the argument

Shepard-normalized radial basis function expansion whose coefficients are obtained by sparse regression, augmented by adaptive refinement and subdomain partitioning for parallel evaluation.

Load-bearing premise

Shepard normalization stabilizes the RBF approximation near sharp interfaces so that sparse regression can produce robust continuous representations of the original discontinuous data.

What would settle it

Compute the L1 error between the constructed continuous function and a known discontinuous step function while successively increasing the number of basis functions or refinement levels and verify whether the error falls below any prescribed positive threshold.

Figures

Figures reproduced from arXiv: 2605.16564 by Kapil Chawla, Sanghyun Lee, Yeonjong Shin.

Figure 1
Figure 1. Figure 1: Examples of heterogeneous and discontinuous permeability values ( [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Overview of the PAM framework. Piecewise-constant permeability data on [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Individual Gaussian RBFs: (a) φ1(x) centered at c1, (b) φ2(x) centered at c2, and (c) φ3(x) centered at c3. To illustrate the effect of Shepard normalization, we consider a simple example on the domain Ω = [0, 1]2 involving three Gaussian RBFs φ1(x), φ2(x), and φ3(x) with centers c1 = (0.3, 0.3), c2 = (0.7, 0.4), and c3 = (0.5, 0.75), and widths σ1 = 0.10, σ2 = 0.15, and σ3 = 0.07, as shown in [PITH_FULL_… view at source ↗
Figure 4
Figure 4. Figure 4: Shepard-normalized weights: (a) w1(x), (b) w2(x), and (c) w3(x), each satisfying 0 ≤ wm(x) ≤ 1 and P3 m=1 wm(x) = 1 [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Comparison of RBF reconstructions: (a)-(b) unnormalized superpositions [PITH_FULL_IMAGE:figures/full_fig_p008_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Adaptive refinement and Shepard normalization.Black filled circles denote existing RBF centers, while red [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Example 1. (a) Unnormalized Gaussian basis functions [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Example 2. (a) Elastic Net approximation of the step function using M [PITH_FULL_IMAGE:figures/full_fig_p012_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Example 3. (a) Adaptive Elastic Net RBF approximation of [PITH_FULL_IMAGE:figures/full_fig_p013_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Representative two-dimensional permeability fields used in the numerical experiments: (left) Case 1 perme [PITH_FULL_IMAGE:figures/full_fig_p016_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Experiment 1.1. Recovered permeability K ∗ (x) (top row) and the corresponding evolution of RBF center locations (bottom row). In the center plots, previously selected centers are shown with lighter markers, while newly added centers in each accepted round are highlighted. half-open decomposition preserves accuracy [PITH_FULL_IMAGE:figures/full_fig_p018_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Experiment 1.2. Parallel recovery of the reconstructed permeability field [PITH_FULL_IMAGE:figures/full_fig_p019_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Permeability and pressure plots for both test cases. Top row: Case 1 . Bottom row: Case 2. In each case, [PITH_FULL_IMAGE:figures/full_fig_p020_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Pressure fields computed using the same continuous reconstructed permeability [PITH_FULL_IMAGE:figures/full_fig_p021_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Convergence of the pressure solution obtained using the continuous reconstructed permeability [PITH_FULL_IMAGE:figures/full_fig_p022_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Experiment 2. Permeability fields from the SPE10 dataset on the 60 [PITH_FULL_IMAGE:figures/full_fig_p022_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Experiment 2. Pressure solutions obtained on the 60 [PITH_FULL_IMAGE:figures/full_fig_p023_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: Experiment 2. Visualization of pressure fields on two di [PITH_FULL_IMAGE:figures/full_fig_p023_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: Geometry 1: Rectangular domain with locally refined mesh. (a) Computational mesh. (b) Pressure field [PITH_FULL_IMAGE:figures/full_fig_p023_19.png] view at source ↗
Figure 20
Figure 20. Figure 20: Geometry 2: Irregular domain with boundary cuts. (a) Computational mesh. (b) Pressure field [PITH_FULL_IMAGE:figures/full_fig_p024_20.png] view at source ↗
Figure 21
Figure 21. Figure 21: Geometry 3: Rectangular domain with circular holes. (a) Computational mesh. (b) Pressure field [PITH_FULL_IMAGE:figures/full_fig_p024_21.png] view at source ↗
read the original abstract

Material properties such as permeability fields in heterogeneous porous media are often represented as discontinuous, piecewise constant data tied to a given spatial discretization. Such representations are inherently mesh-dependent, requiring interpolation or projection whenever they are transferred to a different discretization. In this work, we develop \emph{Parallel and Adaptive Mesh-Free Approximation (PAM)}, a mesh-independent framework that approximates discontinuous data by a continuous, closed-form function. The resulting approximation can be evaluated consistently across different geometries and numerical discretizations, while preserving sharp interface features. The proposed PAM framework employs radial basis functions (RBFs) to construct continuous approximations of discontinuous data. To accurately capture discontinuities, we incorporate Shepard-normalization, which stabilizes the approximation near sharp interfaces. The coefficients of the RBF expansion are determined via sparse regression, enabling automatic selection of the most relevant basis functions and promoting robust representations. In addition, we develop a novel adaptive refinement approach which further enriches the approximation in regions of rapid spatial variation. We provide a theoretical analysis showing that the proposed normalized RBF framework achieves arbitrarily small $L^1$ error in approximating discontinuous step functions. To enhance computational efficiency, the domain is partitioned into subdomains, and the reconstruction problem is solved independently on each subdomain in parallel. Numerical experiments demonstrate the accuracy, adaptivity, and scalability of the proposed method, including applications to challenging heterogeneous permeability fields.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces the Parallel and Adaptive Mesh-Free Approximation (PAM) method for representing discontinuous data such as permeability fields in heterogeneous porous media. It employs radial basis functions (RBFs) with Shepard normalization to stabilize approximations near sharp interfaces, determines coefficients via sparse regression, applies adaptive refinement in regions of rapid variation, and partitions the domain into subdomains for independent parallel solves. The central claim is a theoretical analysis establishing that the normalized RBF framework achieves arbitrarily small global L¹ error for discontinuous step functions, accompanied by numerical experiments on accuracy, adaptivity, and scalability.

Significance. If the global L¹ error bound holds and controls interface mismatches, the approach supplies a mesh-independent continuous representation of discontinuous fields that preserves sharp features while enabling consistent evaluation across different discretizations. The parallel subdomain strategy and adaptive enrichment address practical scalability needs in large heterogeneous porous-media simulations.

major comments (2)
  1. [Theoretical Analysis] Theoretical Analysis (abstract and main text): The manuscript asserts that the normalized RBF framework with Shepard normalization achieves arbitrarily small L¹ error for discontinuous step functions, yet supplies no derivation, assumptions, or proof steps. This omission is load-bearing because it leaves unverified whether the bound is global and accounts for potential discontinuities or mismatches at artificial subdomain interfaces created by the parallel partitioning.
  2. [Parallel Implementation] Parallel subdomain reconstruction (abstract and method description): The reconstruction is performed independently on each subdomain. Without an explicit uniform continuity, overlap, or interface-matching argument in the error analysis, it is unclear how local per-subdomain L¹ bounds combine into a global L¹ bound that can be made arbitrarily small, as required by the central claim.
minor comments (2)
  1. [Abstract] Abstract: the phrase 'continuous, closed-form function' is correct for the RBF expansion but would benefit from noting that the expansion is finite and its coefficients are obtained by sparse regression.
  2. [Numerical Experiments] Numerical experiments: the reported accuracy and scalability results would be strengthened by inclusion of error bars, explicit data-exclusion criteria, and quantitative measures of interface continuity across subdomains.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable feedback on our manuscript. We address each major comment below and will incorporate revisions to clarify and strengthen the theoretical analysis and parallel error bounds.

read point-by-point responses
  1. Referee: [Theoretical Analysis] Theoretical Analysis (abstract and main text): The manuscript asserts that the normalized RBF framework with Shepard normalization achieves arbitrarily small L¹ error for discontinuous step functions, yet supplies no derivation, assumptions, or proof steps. This omission is load-bearing because it leaves unverified whether the bound is global and accounts for potential discontinuities or mismatches at artificial subdomain interfaces created by the parallel partitioning.

    Authors: We agree that a full derivation is needed to support the central claim. The manuscript currently states the result at a high level, relying on the stabilizing effect of Shepard normalization near discontinuities and the ability of adaptive RBF enrichment to reduce L1 error. In the revised version we will add an explicit proof sketch: first showing that normalized RBFs are dense in L1 for step functions on a single domain (under standard assumptions on the shape parameter and fill distance), then extending to the global case by controlling the measure of interface regions. We will also state the assumptions required for the bound to be global. revision: yes

  2. Referee: [Parallel Implementation] Parallel subdomain reconstruction (abstract and method description): The reconstruction is performed independently on each subdomain. Without an explicit uniform continuity, overlap, or interface-matching argument in the error analysis, it is unclear how local per-subdomain L¹ bounds combine into a global L¹ bound that can be made arbitrarily small, as required by the central claim.

    Authors: The referee correctly notes that independent subdomain solves require an interface argument. We will revise the error analysis section to include a decomposition of the global L1 norm into the sum of local subdomain errors plus a term measuring mismatches across artificial interfaces. By introducing a small overlap between subdomains and using the mesh-free evaluation property, the interface contribution can be bounded by the local approximation error, allowing the global L1 error to be driven arbitrarily small by increasing the number of basis functions and refinement levels per subdomain. Numerical results already show consistent global accuracy; we will add a supporting lemma and corresponding discussion. revision: yes

Circularity Check

0 steps flagged

No circularity: theoretical L1 bound derived independently of fitted parameters or self-citations

full rationale

The paper's central claim is a theoretical analysis establishing arbitrarily small global L1 error for the normalized RBF framework (with Shepard normalization, sparse regression, and adaptive refinement) when approximating discontinuous step functions. No quoted equations or self-citations reduce this bound to a tautological redefinition of the inputs, a fitted parameter renamed as a prediction, or a load-bearing uniqueness result imported from the authors' prior work. The subdomain partitioning is presented purely as a parallel implementation detail whose error control is asserted to follow from the same independent analysis rather than being presupposed by it. The derivation chain therefore remains self-contained against external benchmarks and does not exhibit any of the enumerated circular patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on standard RBF approximation properties plus the paper-specific claim that Shepard normalization stabilizes discontinuities; no new physical entities are introduced and free parameters are not enumerated in the abstract.

axioms (2)
  • domain assumption Radial basis functions can approximate functions from scattered data in a mesh-free manner
    Standard background assumption in RBF literature invoked to justify the continuous representation.
  • ad hoc to paper Shepard normalization stabilizes the approximation near sharp interfaces
    Paper-specific stabilization step introduced to handle discontinuities.

pith-pipeline@v0.9.0 · 5777 in / 1366 out tokens · 47914 ms · 2026-05-19T21:21:44.954860+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

31 extracted references · 31 canonical work pages

  1. [1]

    Bear, Dynamics of Fluids in Porous Media, Elsevier, 1972

    J. Bear, Dynamics of Fluids in Porous Media, Elsevier, 1972

  2. [2]

    Dagan, Flow and Transport in Porous Formations, Springer, 1989

    G. Dagan, Flow and Transport in Porous Formations, Springer, 1989

  3. [3]

    L. J. Durlofsky, Numerical calculation of equivalent grid block permeability tensors for heterogeneous porous media, Water Resources Research 27 (5) (1991) 699–708. 24

  4. [4]

    T. Y . Hou, X.-H. Wu, A multiscale finite element method for elliptic problems in composite materials and porous media, Journal of computational physics 134 (1) (1997) 169–189

  5. [5]

    Efendiev, T

    Y . Efendiev, T. Y . Hou, Multiscale finite element methods: theory and applications, V ol. 4, Springer Science & Business Media, 2009

  6. [6]

    S. Lee, M. F. Wheeler, T. Wick, Pressure and fluid-driven fracture propagation in porous media using an adaptive finite element phase field model, Computer Methods in Applied Mechanics and Engineering 305 (2016) 111–132

  7. [7]

    J. Choo, S. Lee, Enriched galerkin finite elements for coupled poromechanics with local mass conservation, Computer Methods in Applied Mechanics and Engineering 341 (2018) 311–332

  8. [8]

    S. Lee, W. T. Leung, M. Vasilyeva, S.-Y . Yi, Generalized multiscale enriched galerkin method for flow in heterogeneous porous media, submitted for publication (2026)

  9. [9]

    M. J. D. Powell, Radial basis functions for multivariable interpolation: A review, in: J. C. Mason, M. G. Cox (Eds.), Algorithms for Approximation, Clarendon Press, Oxford, 1987, pp. 143–167

  10. [10]

    M. D. Buhmann, Radial Basis Functions: Theory and Implementations, V ol. 12 of Cam- bridge Monographs on Applied and Computational Mathematics, Cambridge University Press, Cambridge, UK, 2003.doi:10.1017/CBO9780511543241

  11. [11]

    Wendland, Scattered Data Approximation, Cambridge University Press, 2005

    H. Wendland, Scattered Data Approximation, Cambridge University Press, 2005

  12. [12]

    C. A. Micchelli, Interpolation of scattered data: Distance matrices and conditionally pos- itive definite functions, Constructive Approximation 2 (1) (1986) 11–22.doi:10.1007/ BF01893414

  13. [13]

    J. Park, I. W. Sandberg, Universal approximation using radial-basis-function networks, Neural Computation 3 (2) (1991) 246–257

  14. [14]

    Fornberg, J

    B. Fornberg, J. Zuev, The runge phenomenon and spatially variable shape parameters in rbf interpolation, Computers & Mathematics with Applications 54 (3) (2007) 379–398

  15. [15]

    Majdisova, V

    Z. Majdisova, V . Skala, Big geo data surface approximation using radial basis functions: A comparative study, Computers & Geosciences 109 (2017) 51–68

  16. [16]

    M. A. Christie, M. J. Blunt, Tenth spe comparative solution project: A comparison of upscaling techniques, SPE Reservoir Evaluation & Engineering 4 (04) (2001) 308–317

  17. [17]

    H. Zou, T. Hastie, Regularization and variable selection via the elastic net, Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67 (2) (2005) 301–320

  18. [18]

    Shepard, A two-dimensional interpolation function for irregularly spaced data, in: Pro- ceedings of the 23rd ACM National Conference, 1968, pp

    D. Shepard, A two-dimensional interpolation function for irregularly spaced data, in: Pro- ceedings of the 23rd ACM National Conference, 1968, pp. 517–524.doi:10.1145/ 800186.810616

  19. [19]

    J. M. Melenk, I. Babuška, The partition of unity finite element method: Basic theory and applications, Computer Methods in Applied Mechanics and Engineering 139 (1–4) (1996) 289–314.doi:10.1016/S0045-7825(96)01087-0. 25

  20. [20]

    Babuška, J

    I. Babuška, J. M. Melenk, The partition of unity method, International Journal for Numerical Methods in Engineering 40 (4) (1997) 727–758.doi:10.1002/(SICI) 1097-0207(19970228)40:4<727::AID-NME86>3.0.CO;2-N

  21. [21]

    Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statis- tical Society: Series B (Statistical Methodology) 58 (1) (1996) 267–288

    R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statis- tical Society: Series B (Statistical Methodology) 58 (1) (1996) 267–288

  22. [22]

    A. E. Hoerl, R. W. Kennard, Ridge regression: Biased estimation for nonorthogonal prob- lems, Technometrics 12 (1) (1970) 55–67

  23. [23]

    Friedman, T

    J. Friedman, T. Hastie, R. Tibshirani, Regularization paths for generalized linear models via coordinate descent, Journal of Statistical Software 33 (1) (2010) 1–22

  24. [24]

    S. J. Wright, Coordinate descent algorithms, Mathematical Programming 151 (1) (2015) 3–34

  25. [25]

    Logg, K.-A

    A. Logg, K.-A. Mardal, G. N. Wells, Automated Solution of Differential Equations by the Finite Element Method: The FEniCS Book, Springer, 2012

  26. [26]

    M. S. Alnæs, J. Blechta, J. Hake, A. Johansson, B. Kehlet, A. Logg, C. Richardson, J. Ring, M. E. Rognes, G. N. Wells, The fenics project version 1.5, Archive of Numerical Software 3 (100) (2015)

  27. [27]

    Rivière, Discontinuous Galerkin methods for solving elliptic and parabolic equations: theory and implementation, SIAM, 2008

    B. Rivière, Discontinuous Galerkin methods for solving elliptic and parabolic equations: theory and implementation, SIAM, 2008

  28. [28]

    Lee, Y .-J

    S. Lee, Y .-J. Lee, M. F. Wheeler, A locally conservative enriched galerkin approximation and efficient solver for elliptic and parabolic problems, SIAM Journal on Scientific Com- puting 38 (3) (2016) A1404–A1429

  29. [29]

    Scovazzi, M

    G. Scovazzi, M. F. Wheeler, A. Mikeli´c, S. Lee, Analytical and variational numerical meth- ods for unstable miscible displacement flows in porous media, Journal of Computational Physics 335 (2017) 444–496

  30. [30]

    Arbogast, Implementation of a locally conservative numerical subgrid upscaling scheme for two-phase darcy flow, Computational Geosciences 6 (3) (2002) 453–481

    T. Arbogast, Implementation of a locally conservative numerical subgrid upscaling scheme for two-phase darcy flow, Computational Geosciences 6 (3) (2002) 453–481

  31. [31]

    Dawson, S

    C. Dawson, S. Sun, M. F. Wheeler, Compatible algorithms for coupled flow and transport, Computer Methods in Applied Mechanics and Engineering 193 (23-26) (2004) 2565–2580. 26