Search arXivSearch

arXiv · 2608.25679

Foundations of Global Ocean Climate Modelling at all Scales

Abstract

We introduce a computational method that extends the range of current global ocean climate models to non-hydrostatic scales, and establishes a convection resolving ocean model. The main obstruction towards this goal at global scale -the calculation of the non-hydrostatic pressure- is resolved by computing the pressure locally in a manner that capitalizes on particular conditions of ocean dynamics, and the structure of ocean models. Our claims are substantiated 1) by a theoretical analysis, which shows that the proposed method is compatible with ocean physics, 2) by numerical experiments, which evidence by comparison that it represents faithfully and to high accuracy non-hydrostatic dynamics, and 3) by a performance analysis that establishes that our non-hydrostatic method exceeds the cost of a hydrostatic model by a fixed factor of about $1.2$ in operation count and $1.3$ in runtime at any resolution. We show how to use the additional information contained in non-hydrostatic scales can be used to calculate the diffusivity free from numerical contributions and the mixing efficiency, transforming both from prescribed values by the modeller to calculated values from the dynamics.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Korn. 2026-09-05. Foundations of Global Ocean Climate Modelling at all Scales. https://arxiv.org/abs/2608.25679

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA