Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.18854

A numerical benchmark for fluid--structure--contact interaction

Daniele Corti·Jakub Fara·Miguel Angel Fernández·Stefan Frei·Tobias Knoke·Sebastian Schwarzacher·Karel Tůma·Thomas Wick
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a two-dimensional benchmark for fluid-structure-contact interaction consisting of a deformable elastic disk falling under gravity within a viscous incompressible fluid and rebounding in the vicinity of the bottom wall. Solid deformability is essential, as rigid solids do not rebound in this framework. Besides this, the setting is deliberately kept simple to facilitate reproduction. The configuration is particularly challenging due to the well-known no-contact paradox, which can lead to a contactless rebound and forces numerical methods to resolve a vanishingly thin fluid layer in the near-contact region, making the dynamics highly sensitive to the spatial and temporal discretizations. In addition to no-slip boundary and interface conditions, a reduced porous modeling of surface roughness, either on the disk boundary or on the bottom wall, is also considered; this circumvents the no-contact paradox and enables genuine contact. An energy balance law is derived theoretically for all three cases. Eight numerical methodologies, developed by five research groups and spanning different model formulations, numerical methods, and codes (including both fitted and unfitted discretizations), are applied to the benchmark at several levels of spatial and temporal refinement. Quantities of interest of varying complexity are collected and compared, showing close agreement during the falling phase and increased sensitivity in the near-contact and rebound regimes. The setting and the results provide a suitable reference for the systematic assessment of fluid-structure-contact interaction solvers. The time histories of all quantities of interest for every approach and refinement level are provided as supplementary material.

Explore related subjects

math.NAcs.NAphysics.flu-dyn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniele Corti, Jakub Fara, Miguel Angel Fernández, Stefan Frei, Tobias Knoke, Sebastian Schwarzacher, Karel Tůma, Thomas Wick. 2026-09-16. A numerical benchmark for fluid--structure--contact interaction. https://arxiv.org/abs/2609.18854

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↗