Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.10326

Sensitivity analysis with a 3D mixed-dimensional code for DC geoelectrical investigations of landfills: synthetic tests

Lorenzo Panzeri·Alessio Fumagalli·Laura Longoni·Monica Papini·Diego Arosio
View original source ↗Read source document ↗Export metadata ↓

Abstract

Electrical resistivity tomography is a suitable technique for non-invasive monitoring of municipal solid waste landfills, but accurate sensitivity analysis is necessary to evaluate the effectiveness and reliability of geoelectrical investigations and to properly design data acquisition. Commonly, a thin high-resistivity membrane in placed underneath the waste to prevent leachate leakage. In the construction of a numerical framework for sensitivity computation, taking into account the actual dimensions of the electrodes and, in particular, of the membrane, can lead to extremely high computational costs. In this work, we present a novel approach for numerically computing sensitivity effectively by adopting a mixed-dimensional framework, where the membrane is approximated as a 2D object and the electrodes as 1D objects. The code is first validated against analytical expressions for simple 4-electrode arrays and a homogeneous medium. It is then tested in simplified landfill models, where a 2D box-shaped liner separates the landfill body from the surrounding media, and 48 electrodes are used. The results show that electrodes arranged linearly along both sides of the perimeter edges of the box-shaped liner are promising for detecting liner damage, with sensitivity increasing by 2-3 orders of magnitude, even for damage as small as one-sixth of the electrode spacing in diameter. Good results are also obtained when simulating an electrical connection between the landfill and the surrounding media that is not due to liner damage. The next steps involve evaluating the minimum number of configurations needed to achieve suitable sensitivity with a manageable field effort and validating the modeling results with downscaled laboratory tests.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lorenzo Panzeri, Alessio Fumagalli, Laura Longoni, Monica Papini, Diego Arosio. 2024-09-16. Sensitivity analysis with a 3D mixed-dimensional code for DC geoelectrical investigations of landfills: synthetic tests. https://arxiv.org/abs/2409.10326

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗