Search arXivSearch

arXiv · 2507.20306

A Hybrid Particle-Continuum Method for Simulating Fast Ice via Subgrid Iceberg Interaction

Abstract

A significant fraction (4%-13%) of Antarctic sea ice remains stationary as landfast sea-ice ("fast ice"), typically anchored by grounded icebergs. Current global climate models do not represent fast-ice formation due to iceberg grounding, as iceberg-sea-ice interaction mostly occurs at subgrid scales. We propose a novel subgrid-scale coupling mechanism between Lagrangian iceberg particles and an Eulerian sea-ice continuum model. This hybrid particle-continuum approach integrates feedback from icebergs into the sea-ice momentum equation via a Green's function, a Stokeslet, representing the drag exerted by a point force on the viscous-plastic medium. The coupled system, including the Stokeslet induced drag, is discretized using a finite-element method with piecewise linear basis functions. The approach assumes that individual icebergs have diameters smaller than the grid spacing. The presented finite-element discretization is compatible with existing unstructured-mesh ocean model frameworks such as FESOM and ICON, ensuring practical applicability in Earth system modeling. This work provides and analyzes, for the first time, a stable numerical framework to capture the effects of individual subgrid-scale icebergs on sea-ice dynamics. We derive an a-priori stability estimate bounding a functional of the sea-ice system and show that the momentum equation including the subgrid iceberg-sea-ice drag remains stable. Numerical test cases demonstrate the capability of the approach to capture fast-ice formation due to subgrid iceberg grounding on coarse horizontal grids.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carolin Mehlmann, Saskia Kahl. 2025-07-27. A Hybrid Particle-Continuum Method for Simulating Fast Ice via Subgrid Iceberg Interaction. https://arxiv.org/abs/2507.20306

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

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA