Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.00920

Exploring physics-dynamics coupling using moist shallow water equations

Nell Hartney·Thomas M. Bendall·Jemma Shipton
View original source ↗Read source document ↗Export metadata ↓

Abstract

One of the key choices for numerical models of geophysical fluids is how parametrisations of physical processes interact with the numerical methods that handle the resolved flow, known in the atmospheric community as the dynamical core. As both the dynamical core and parametrisations of physics processes continue to evolve and improve, the issue of physics-dynamics coupling - how these two different parts of the model interact - becomes ever more important. In this paper we use two variations of the moist shallow water equations to develop a simplified framework that can be used to investigate some of the questions associated with physics-dynamics coupling. The shallow water equations act as a simplified dynamical core that is computationally cheap but still retains pertinent features of the atmosphere, and the introduction of moisture means the addition to the model of a physical parametrisation. This study uses 'split-physics' moist thermal shallow water equations which couple moisture to the shallow water equations via a parametrisation, and also develops a new 'integrated-physics' formulation of the moist thermal shallow water equations which re-formulates the model so that all the moist processes are captured in the dynamics. This integrated-physics model thus requires no physics-dynamics coupling and acts as a ground-truth to compare coupling strategies in the split-physics formulation against. We use both models to examine the effect of varying the approach to how physics is coupled to the dynamics in the semi-implicit quasi-Newton timestepping scheme. The results demonstrate the usefulness of the integrated-physics moist shallow water equations and provide insights into how best to deal with physics in a model's timestep.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nell Hartney, Thomas M. Bendall, Jemma Shipton. 2026-04-30. Exploring physics-dynamics coupling using moist shallow water equations. https://arxiv.org/abs/2605.00920

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↗