Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.19993

Modelling and Analysis of Non-Contacting Mechanical Face Seals with Axial Disturbances and Misalignment

Ben S Ashby·Tristan Pryer·Nicola Y Bailey
View original source ↗Read source document ↗Export metadata ↓

Abstract

Advancements in industrial applications are driving developments in non-contacting mechanical seal technology. Key requirements include improvements in efficiency and reliability, which lead to smaller clearances, lower frictional losses, and minimisation of wear, during operation. However, a critical consideration is the effect of external disturbances experience by the seal from the local environment which may cause destabilisation, and lead to premature failures through unanticipated face contact. This work examines the dynamic behaviour of a non-contacting mechanical face seals, where a thin fluid film separates a pair of coaxial discs; a rotor (rotating face) and stator (stationary face). It is assumed that the rotor-stator have an angular misalignment and operation is under conditions involving large axial disturbances, representing external disturbances. A fully coupled unsteady mathematical representation is developed, where the fluid flow is coupled to the structural response of the stator, and the rotor motion is prescribed. The stator is modelled as a spring-mass-damper system, and the fluid film model is based on a lubrication approximation of the Navier-Stokes equations. The governing equations are solved via a numerical technique based on finite element and Runge-Kutta methods. A parameter study reveals the impact of misalignment on the seal dynamics, when experiencing an external disturbance. The angle of misalignment and corresponding amplitude of forcing can be identified when the minimum fluid film thickness becomes less than a given tolerance. This provides insights into safe operating conditions and manufacturing tolerances, with the research aiding to improve the design critera and reliability of non-contacting mechanical face seals.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ben S Ashby, Tristan Pryer, Nicola Y Bailey. 2025-09-24. Modelling and Analysis of Non-Contacting Mechanical Face Seals with Axial Disturbances and Misalignment. https://arxiv.org/abs/2509.19993

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↗