Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.15913

A simulation platform for slender, semiflexible, and inextensible fibers with Brownian hydrodynamics and steric repulsion

Ondrej Maxian·Aleksandar Donev
View original source ↗Read source document ↗Export metadata ↓

Abstract

The last few years have witnessed an explosion of new numerical methods for filament hydrodynamics. Aside from their ubiquity in biology, physics, and engineering, filaments present unique challenges from an applied-mathematical point of view. Their slenderness, inextensibility, semiflexibility, and meso-scale nature all require numerical methods that can handle multiple lengthscales in the presence of constraints. Accounting for Brownian motion while keeping the dynamics in detailed balance and on the constraint is difficult, as is including a background solvent, which couples the dynamics of multiple filaments together in a suspension. In this paper, we present a simulation platform for deterministic and Brownian inextensible filament dynamics which includes nonlocal fluid dynamics and steric repulsion. For nonlocal hydrodynamics, we define the mobility on a single filament using line integrals of Rotne-Prager-Yamakawa regularized singularities, and numerically preserve the symmetric positive definite property by using a thicker regularization width for the nonlocal integrals than for the self term. For steric repulsion, we introduce a soft local repulsive potential defined as a double-integral over two filaments, then present a scheme to identify and evaluate the nonzero components of the integrand. Using a temporal integrator developed in previous work, we demonstrate that Langevin dynamics sample from the equilibrium distribution of free filament shapes, and that the modeling error in using the thicker regularization is small. We conclude with two examples, sedimenting filaments and cross-linked fiber networks, in which nonlocal hydrodynamics does and does not generate long-range flow fields, respectively. In the latter case, we show that the effect of hydrodynamics can be accounted for through steric repulsion.

Explore related subjects

math.NAcond-mat.softcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ondrej Maxian, Aleksandar Donev. 2024-11-20. A simulation platform for slender, semiflexible, and inextensible fibers with Brownian hydrodynamics and steric repulsion. https://arxiv.org/abs/2408.15913

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↗