Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2103.00081

An HPC-Based Hydrothermal Finite Element Simulator for Modeling Underground Response to Community-Scale Geothermal Energy Production

Xiang Sun·Kenichi Soga·Alp Cinar·Zhenxiang Su·Kecheng Chen·Krishna Kumar·Patrick F. Dobson·Peter S. Nico
View original source ↗Read source document ↗Export metadata ↓

Abstract

Geothermal heat, as renewable energy, shows great advantage with respect to its environmental impact due to its significantly lower CO2 emissions than conventional fossil fuel. Open and closed-loop geothermal heat pumps, which utilize shallow geothermal systems, are an efficient technology for cooling and heating buildings, especially in urban areas. Integrated use of geothermal energy technologies for district heating, cooling, and thermal energy storage can be applied to optimize the subsurface for communities to provide them with multiple sustainable energy and community resilience benefits. The utilization of the subsurface resources may lead to a variation in the underground environment, which might further impact local environmental conditions. However, very few simulators can handle such a highly complex set of coupled computations on a regional or city scale. We have developed high-performance computing (HPC) based hydrothermal finite element (FE) simulator that can simulate the subsurface and its hydrothermal conditions at a scale of tens of km. The HPC simulator enables us to investigate the subsurface thermal and hydrologic response to the built underground environment (such as basements and subways) at the community scale. In this study, a coupled hydrothermal simulator is developed based on the open-source finite element library deal.II. The HPC simulator was validated by comparing the results of a benchmark case study against COMSOL Multiphysics, in which Aquifer Thermal Energy Storage (ATES) is modeled and a process of heat injection into ATES is simulated. The use of an energy pile system at the Treasure Island redevelopment site (San Francisco, CA, USA) was selected as a case study to demonstrate the HPC capability of the developed simulator. The simulator is capable of modeling multiple city-scale geothermal scenarios in a reasonable amount of time.

Explore related subjects

cs.DCphysics.geo-ph

Keep this discovery

BibTeXRIS

Xiang Sun, Kenichi Soga, Alp Cinar, Zhenxiang Su, Kecheng Chen, Krishna Kumar, Patrick F. Dobson, Peter S. Nico. 2021-02-26. An HPC-Based Hydrothermal Finite Element Simulator for Modeling Underground Response to Community-Scale Geothermal Energy Production. https://arxiv.org/abs/2103.00081

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

KEEP EXPLORING

Related papers

arXiv2026

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC↗
arXiv2026

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC↗
arXiv2026

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC↗