Geometric Topology
A Steenrod square on Khovanov homology and a cup-i product
Advika Rajapakse
Lipshitz-Sarkar defined a stable homotopy type refining Khovanov homology, producing
cohomology operations $\text{Sq}^i$ on the Khovanov homology $Kh(L)$ of a link $L$. Later, Morán proposed a sequence of cup-i products on the $\mathbb{F}_2$-coefficient cochain complex of any augmented semi-simplicial object in the Burnside category. Applied to the Khovanov functor, he obtained another sequence of operations $\mathfrak{sq}^n$ on $Kh(L)$, where $\mathfrak{sq}^0$, $\mathfrak{sq}^1$ agree with the usual Steenrod squares. We prove that Lipshitz-Sarkar's $\text{Sq}^2$, the first Steenrod operation that cannot be computed from merely homological data, agrees with Morán's $\mathfrak{sq}^2$.
Read the full abstract ▾
Numerical Analysis · Cross-listed from quant-ph
Quantum Estimation of Non-Hermitian Pseudospectra
Gengzhi Yang, Jiaqi Leng, Xiaodi Wu et al. (+1 more)
Non-Hermitian many-body systems can be spectrally unstable, so small perturbations may induce large
eigenvalue shifts. The pseudospectrum quantifies this instability and provides a perturbation-robust diagnostic. For inverse-polynomially small $\epsilon$, we show that deciding whether a point $z\in\mathbb{C}$ is $\epsilon$-close to the spectrum is PSPACE-hard for $5$-local operators, whereas deciding whether $z$ lies in the $\epsilon$-pseudospectrum is QMA-complete for $4$-local operators. This identifies pseudospectrum membership as a more realistic computational target. We then present a concrete
quantum framework for deciding pseudospectrum membership, which combines a singular-value estimation step with a dissipative state preparation
algorithm. Our
Quantum Singular-value Gaussian-filtered Search (QSIGS) combines
quantum singular value transformation (QSVT) with classical post-processing to achieve Heisenberg-limited query scaling for singular-value estimation. To prepare suitable input states, we introduce an algorithmic Lindbladian protocol for approximate ground right singular vectors and prove its effectiveness for the Hatano–Nelson model. Finally, we demonstrate the full pipeline on a trapped-ion
quantum computer and distinguish points inside and outside the target pseudospectrum near the exceptional point of a minimal non-Hermitian
qubit model.
Read the full abstract ▾
All authors Gengzhi Yang, Jiaqi Leng, Xiaodi Wu, Lin Lin
Statistics Theory
Equivalence testing with data-dependent and post-hoc equivalence margins
Stan Koobs and Nick W. Koning
Equivalence testing compares the hypothesis that an effect $\mu$ is large against the alternative that it is negligible. Here, `large' is classically expressed as being larger than some `equivalence margin' $\Delta$. A longstanding problem is that this margin must be specified but can rarely be objectively justified in practice. We lay the foundation for an alternative paradigm, arguing to instead report a data-dependent margin $\widehat{\Delta}_\alpha$ that bounds the true effect $\mu$ with probability $1 - \alpha$. Our key argument is that $\widehat{\Delta}_\alpha$ is more useful than a test outcome at a fixed margin $\Delta$, as measured by the guarantees it offers to decision makers. We generalize this to a curve of margins $\alpha \mapsto \widehat{\Delta}_\alpha$, uniformly valid under the post-hoc selection of the margin. These ideas rely on e-values, which we derive for models that are strictly totally positive of order 3, nesting the classical z-test and t-test settings.
Read the full abstract ▾
Optimization and Control
Decentralized design of leader-following consensus protocols for asymmetric matrix-weighted heterogeneous multiagent systems
Lanhao Zhao and Yangzhou Chen
This paper investigates a decentralized design approach of leader-following consensus protocols for heterogeneous multiagent systems under a fixed communication
topology with a directed spanning tree (DST) and asymmetric weight
matrix. First, a control protocol using only the information of the neighbor on the DST of each
agent is designed, which is called the consensus protocol with minimal communication links. Particularly, the DST-based linear transformation method is used to transform the consensus problem into a partial variable stability problem of a corresponding system, and a decentralized design method is proposed to find the gain
matrices in the protocols. Next, the decentralized design approach is extended to the protocols using all neighbor information in the original communication
topology with the help of the
matrix diagonally dominant method. Some numerical simulations are given to illustrate the theoretical results.
Read the full abstract ▾
Commutative Algebra
Licci Property of Complementary Edge Ideals
Vivek Bhabani Lama
In this article, we characterize the class of complementary edge ideals which satisfy the licci property in terms of the underlying graph. Using this characterization, we associate the licci property of a complementary edge ideal to its other algebraic properties. Finally, we provide two different probability regimes for which the complementary edge ideals of random graphs are licci with high probability and not licci with high probability respectively.
Read the full abstract ▾
Probability
Extinction behaviour for mutually enhancing continuous-state population dynamics
Jie Xiong, Xu Yang and Xiaowen Zhou
In this paper, we study a two-dimensional process arising as the unique nonnegative solution to a system of two
stochastic differential equations (SDEs) with mutually enhancing two-way interactions driven by independent Brownian motions and spectrally positive $\alpha$-stable random measures. Such a SDE system can be identified as a continuous-state Lotka-Volterra type population model. Extinction properties of the populations are studied for different choices of the coefficients involved in the SDEs.
Read the full abstract ▾
Information Theory
Non-GRS type Euclidean and Hermitian LCD codes and Their Applications for EAQECCs
Zhonghao Liang, Dongmei Huang, Qunying Liao et al. (+2 more)
In recent years, the construction of non-GRS type linear codes has attracted considerable
attention due to that they can effectively resist both the Sidelnikov-Shestakov attack and the Wieschebrink attack. Constructing linear complementary dual (LCD) codes and determining the hull of linear codes have long been important topics in coding theory, as they play the crucial role in constructing
entanglement-assisted
quantum error-correcting codes (EAQECCs), certain communication systems and cryptography. In this paper, by utilizing a class of non-GRS type linear codes, namely, generalized Roth-Lempel (in short, GRL) codes, we firstly construct several classes of Euclidean LCD codes, Hermitian LCD codes, and linear codes with small-dimensional hulls, generalized the main results given by Wu et al. in 2021. We also present an upper bound for the number of a class of Euclidean GRL codes with 1-dimensional hull, and then for several classes of Hermitian GRL codes, we firstly derive an upper bound for the dimension of the hull, and prove that the bound is attainable. Secondly, as an application, we obtain several families of EAQECCs. Thirdly, we prove that the GRL code is non-GRS for $k >\ell$. Finally, some corresponding examples for LCD MDS codes and LCD NMDS codes are presented.
Read the full abstract ▾
All authors Zhonghao Liang, Dongmei Huang, Qunying Liao, Cuiling Fan, Zhengchun Zhou
Numerical Analysis
Weak Adversarial Neural Pushforward Method for the McKean-Vlasov / Mean-Field Fokker-Planck Equation
Andrew Qing He and Wei Cai
We extend the Weak
Adversarial Neural Pushforward Method (WANPM) to the McKean–Vlasov mean-field Fokker–Planck equation, covering both the stationary and time-dependent cases. The key observation is that the mean-field nonlinearity – an expectation under the solution distribution – is naturally estimated by Monte Carlo sampling from the pushforward network, requiring no change to the architecture and only minor modifications to the training loop. For the quadratic (granular media) interaction kernel, the interaction term reduces to the batch sample mean, eliminating secondary sampling entirely. We also identify a dimension-dependent frequency initialization rule for the
adversarial test functions, necessary to avoid spurious minimizers. Numerical experiments on linear McKean–Vlasov
benchmarks in 2, 5, 20, and 100 dimensions confirm accurate recovery of the exact Gaussian stationary and transient distributions, with training times ranging from 27 seconds (2D) to 10 minutes (100D) on a single GPU.
Read the full abstract ▾
Optimization and Control
Decentralized design of consensus protocols with minimal communication links based on directed spanning tree
Yangzhou Chen and Lanhao Zhao
This paper proposes a decentralized design approach of consensus protocols of multi-
agent systems via a directed-spanning-tree(DST)-based linear transformation and the corresponding minimal communication links. First, the consensus problem of multi-
agent systems is transformed into the decentralized output stabilization problem by constructing a linear transformation based on a DST of the communication
topology, and thus a necessary and sufficient consensus criterion in terms of decentralized fixed mode is derived. Next, a new distributed protocol is designed by using only the neighbors information on the DST, which is a fully decentralized design approach. Finally, some numerical examples are given to verify the results attained.
Read the full abstract ▾
Commutative Algebra
Classification of unmixed parity binomial edge ideals of cactus and chordal graphs
Deblina Dey, A. V. Jayanthan and Sarang Sane
In this article, we characterize all unmixed and Cohen-Macaulay parity binomial edge ideals of cactus and chordal graphs in terms of the structural properties of the graph.
Numerical Analysis · Cross-listed from nlin.CD
Effect of machine arithmetic errors for multi-turn invariant curve destruction
David Nikitin and Nataliya Stankevich
Using the example of three-dimensional Mira map, it is shown that the destruction of a multi-turn invariant curve can occur through the appearance of local multiple bends. It was found that, depending on the precision of machine arithmetic, a complication of the multi-turn invariant curve can be observed, which is a numerical artifact. Artifact can be avoided with increasing of machine arithmetic accuracy.
Read the full abstract ▾
Analysis of PDEs
Long time dynamics and anomalous dissipation of energy in viscous forced active scalar equations
Susan Friedlander and Anthony Suen
We study an abstract family of advection-
diffusion equations within the framework of the fractional
Laplacian. The system involves two independent
diffusion parameters: one introduced via a damping operator acting on the scalar unknown and the other as the coefficient of the fractional
Laplacian. We establish existence and convergence results in specific parameter regimes and limits. In particular, we demonstrate the absence of anomalous energy dissipation for long-time averaged solutions. Moreover, we investigate the long time dynamics and prove the existence of a unique global attractor. These results are then applied to two specific classes of active scalar equations in geophysical fluid dynamics, namely the surface quasigeostrophic equation and the magnetogeostrophic equation.
Read the full abstract ▾
Analysis of PDEs
Existence, asymptotic behaviour and convergence of a generalised 3D Muskat problem in stable regime
Qasim Khan, Anthony Suen and Bao Quoc Tang
We address a generalised three-dimensional $\alpha$-Muskat model that comes from the fluid interface problem given by two incompressible fluids with different densities in the stable regime. We establish local-in-time wellposedness when $\alpha\in[0,1)$ and also prove global-in-time existence for strong solutions when $\alpha\in[0,\frac{1}{2})$ with initial data controlled by explicit constants. We obtain maximum principles for the $L^{\infty}$-norms of both the solutions and their gradients, and we further acquire the corresponding decay rates of these $L^{\infty}$-norms. Finally, some convergence results for strong solutions as $\alpha\to0^+$ are also proved.
Read the full abstract ▾
Functional Analysis
On the norms of the multiplication operators between weighted Bergman spaces
Jianjun Jin
In this paper, we study the norms of multiplication operators acting between weighted Bergman spaces. First, we provide a proof for a norm estimate previously announced in our recent paper \cite{Jin-c}. Second, we establish a sharp norm estimate for certain special multiplication operators between weighted Bergman spaces, a result that is novel to the literature. Finally, we also discuss the connections between the Brennan
conjecture and related multiplier norms induced by the Schwarzian derivative of univalent functions.
Read the full abstract ▾
Optimization and Control
Minimax solutions of path-dependent Hamilton–Jacobi equations under weakened assumptions with application to differential games
Mikhail Gomoyunov
We study minimax (generalized) solutions of a Cauchy problem for a (first-order) path-dependent Hamilton–Jacobi equation with co-invariant derivatives under a right-end boundary condition. Under assumptions on the
Hamiltonian that are more general than those previously considered in the literature and allow, in particular, a measurable dependence on the first (time) variable, we establish existence, uniqueness, stability, and consistency results for minimax solutions. As an application, we consider a zero-sum differential game for a time-delay system and prove that this game has a value under assumptions more general than the known ones but rather natural being consistent with the Carathéodory conditions.
Read the full abstract ▾
Spectral Theory
A note on the distribution of Neumann eigenvalues of the Laplacian on a Euclidean convex domain
Kei Funano
We establish two universal inequalities for Neumann
eigenvalues of the
Laplacian on a Euclidean convex domain.
Information Theory · Cross-listed from eess.SP
Wireless Digital Twin Calibration: Refining DFT-Domain Channel Information
Hao Luo, Saeed R. Khosravirad and Ahmed Alkhateeb
Wireless digital twins can be leveraged to provide site-specific synthetic channel information through precise physical modeling and signal propagation simulations. This can help reduce the overhead of channel state information (CSI) acquisition, particularly needed for large-scale
MIMO systems. For high-quality digital twin channels, the classical approach is to increase the digital twin fidelity via more accurate modeling of the environment, propagation, and hardware. This, however, comes with high computational cost, making it unsuitable for real-time applications. In this paper, we propose a new framework that, instead of calibrating the digital twin model itself, calibrates the DFT-domain channel information to reduce the gap between the low-fidelity digital twin and its high-fidelity counterpart or the real world. This allows systems to leverage a low-complexity digital twin for generating real-time channel information without compromising quality. To evaluate the effectiveness of the proposed approach, we adopt codebook-based CSI feedback as a case study, where refined synthetic channel information is used to identify the most relevant DFT codewords for each user. Simulation results demonstrate the effectiveness of the proposed digital twin calibration approach in achieving high CSI acquisition accuracy while reducing the computational overhead of the digital twin. This paves the way for realizing digital twin assisted wireless systems.
Read the full abstract ▾
Algebraic Topology · Cross-listed from cs.LG
Functorial Neural Architectures from Higher Inductive Types
Karen Sargsyan
Neural networks often learn the parts of a task but fail on novel combinations of those parts. We argue that this failure is architectural: a decoder generalizes compositionally only when it respects the algebraic laws of the task, i.e. when it descends from freely generated sequences to the quotient determined by those laws. We make this principle constructive by compiling Higher Inductive Type (HIT) specifications into neural architectures. Basepoints, path constructors, and 2-
cells are mapped to base constraints, generator networks, structural concatenation, and learned homotopies. The resulting transport decoders are strict monoidal functors by construction: decoding a concatenated word is concatenation of independently generated loop segments. In contrast, we prove that softmax self-
attention cannot simultaneously satisfy strict monoidal composition and descent to any non-trivial compositional quotient. Experiments on the
torus, wedge of circles, and Klein bottle validate the predicted hierarchy: functorial decoders outperform non-functorial alternatives by $2$–$10\times$, and a learned 2-
cell closes a $46\%$ error gap precisely on words exercising the Klein-bottle relation. These results suggest that compositional generalization should be enforced as functorial structure in the architecture, rather than learned from examples alone.
Read the full abstract ▾
Combinatorics
A Dyadic Frequency Law for a Perturbed Hofstadter $Q$-Recursion
Marco Mantovanelli
We study the perturbed Hofstadter $Q$-recursion $$ Q(1)=Q(2)=1,\qquad Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n \quad (n\ge 3). $$ Cloître proved that the recursion is globally well-defined and encoded its odd- and even-indexed subsequences by exact binary arches and canonical plane forests. Since every value is odd, let $$ F(s)=\#\{n\ge 1:Q(n)=2s-1\}. $$ We prove that, for every $k\ge 0$, $$ \{F(s):2^k\le s<2^{k+1}\} = \{3+\nu_2(j):1\le j\le 2^k\} $$ as multisets. Thus the
theorem determines the multiplicities of the frequencies in each dyadic block, but not their order. The proof converts frequencies into plateau local times, folds paired gap degrees under reversal-complementation, and identifies the resulting multiset with the degree multiset of a canonical tree. An ordered central-pair lemma is the boundary step that makes the dyadic cut exact.
Read the full abstract ▾
Number Theory
Analogue of the theta group $\Gamma_{\theta},$ II
Kazuhide Matsuda
In this series of papers, we introduce higher level versions of the theta group $\Gamma_{\theta}.$ In this paper, we treat the theta group of level $5$, $\Gamma_{\theta,5},$ and construct modular forms on $\Gamma_{\theta,5}$. Moreover we compute their multiplier systems. For this purpose, we derive transformation formula of theta function with characteristics.
Read the full abstract ▾
Probability · Cross-listed from q-fin.MF
Short-horizon Duesenberry Equilibrium
Jaime Alberto Londoño
We develop a continuous-time general
equilibrium framework for an infinite heterogeneous population whose household types are transported by a Brownian flow.
Agents repeatedly solve short-horizon optimization problems over state-price-discounted consumption and wealth, which admit an endogenous relative-income criterion in
equilibrium. For the resulting Radner-type
equilibrium—a short-horizon Duesenberry
equilibrium—we obtain a complete characterization and an existence
theorem;
market completeness and the absence of state-tame arbitrage emerge endogenously from
market clearing. Finally, the equity premium puzzle is shifted to a question about the
volatility of aggregate total wealth, while the risk-free rate puzzle admits a plausible resolution.
Read the full abstract ▾
Complex Variables
Characterizations of Hardy spaces on tube domains over polyhedral cones
Zunwei Fu, Loukas Grafakos, Wei Wang et al. (+1 more)
This paper is devoted to the equivalence of various characterizations of holomorphic $H^1$ Hardy spaces on tube domains over polyhedral cones. We establish a new iterated Poisson integral formula which reproduces holomorphic functions on such domains. However, this formula shows that holomorphic $H^1$ functions have boundary values in a new type of Hardy space of real variables on their Shilov boundaries $\mathbb{R}^n$, which cannot be treated by standard classical multi-parameter harmonic analysis. We overcome this difficulty by developing techniques suitably adapted in this setting. Using the iterated Poisson integral as our approximation to the identity, and employing a lifting technique, we introduce various notions of multi-parameter analysis adapted to tube domains, such as twisted rectangles, new non-tangential approach regions, non-tangential maximal functions and Littlewood-Paley type functions. All these notions exhibit new
geometric features associated with polyhedral cones and involve hidden parameters, as in the flag setting. We develop the necessary multi-parameter tools to investigate these new Hardy spaces. In particular, we apply these tools to obtain equivalent characterizations of the holomorphic $H^1$ Hardy spaces on tube domains in terms of non-tangential maximal, Lusin-Littlewood-Paley area and Littlewood-Paley $g$-functions.
Read the full abstract ▾
All authors Zunwei Fu, Loukas Grafakos, Wei Wang, Qingyan Wu
Optimization and Control
Occupation-Measure Mean-Field Control: Optimization over Measures and Frank-Wolfe Methods
Di Yu, Sixiong You and Chaoying Pei
Coordinating large populations of autonomous
agents, such as
UAV swarms or satellite constellations, poses significant computational challenges for traditional multi-
agent control methods. This paper introduces a new optimization framework for large-population control, termed occupation-measure mean-field control (OM-MFC). The framework models the
evolution of
agent populations directly in the space of occupation measures and casts large-population control as an infinite-dimensional optimization problem over measures, which becomes convex under a positive-semidefiniteness condition on the interaction kernel. A Frank–Wolfe (FW)
algorithm and its fully-corrective variant (FCFW) are developed to solve the resulting problem efficiently, where each iteration reduces to a classical optimal control subproblem. Theoretical results establish convexity, existence of optimal solutions, and convergence guarantees of the proposed
algorithms. Owing to its measure-based formulation, the framework naturally accommodates systems with very large numbers of
agents. Numerical experiments on
UAV swarm coordination and satellite constellation control demonstrate the scalability and effectiveness of the proposed approach in high-dimensional and constrained environments.
Read the full abstract ▾
Analysis of PDEs
Non-existence results for a system of wave inequalities on locally finite graphs
Anh Tuan Duong and Tuan Anh Dao
Let $V$ be a locally finite, connected and weighted graph. We study non-existence results of non-trivial, non-negative solutions of the system $$ \begin{cases} u_{t t}-\Delta u \geq h_1|v|^p & \text { in } V \times(0, \infty), v_{t t}-\Delta v \geq h_2|u|^q & \text { in } V \times(0, \infty), u=u_0;\;v=v_0 & \text { in } V \times\{0\}, u_t=u_1;\;v_t=v_1 & \text { in } V \times\{0\}, \end{cases}$$ where $p,q>1$, $h_1, h_2$ are positive potentials. Under some volume growth condition of a ball, we prove that the system has no non-trivial non-negative solutions. In particular, our result is a natural extension of that in [D.~D.~Monticelli, F.~Punzo, and J.~Somaglia. Nonexistence results for the semilinear wave equation on graphs. arXiv.2506.08697, 2025.] from a single inequality to a system.
Read the full abstract ▾
Differential Geometry
The behaviour of moving points on curves: A rotating frame approach
Dong Han
In this paper, we construct rotating frames for curves, including plane curves, space curves and curves on surfaces. Hence, the behaviour of an arbitrary moving point on a curve can be seen as the composite of linear motion and rotation. Conversely, it can also be proved that a curve can be determined by the two motions of a moving point on it, namely, linear motion and rotation. Thus, we obtain a new binary mathematical formation mechanism for curves based on the aforementioned two motions. Finally, we apply this rotating frame method to the study of the behaviour of moving points on ellipses.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Finite Boundary-Layer Residence Certificates for Non-Strict Control Barrier Functions
Tianyu Han, Guangwei Wang and Bo Wang
Non-strict control barrier function (CBF) conditions guarantee safety through forward invariance, but they do not preclude trajectories from remaining near the safe-set boundary for extended continuous time intervals. This paper develops a finite boundary-layer residence certificate for such settings. The certificate preserves the standard non-strict CBF safety condition and uses a bounded auxiliary function whose derivative is bounded away from zero in a prescribed boundary layer, yielding an explicit upper bound on every uninterrupted residence interval. For control-affine systems, a selected auxiliary branch is implemented as an additional affine constraint in a CBF-QP, and a tangential-input compatibility condition is given to ensure simultaneous feasibility with the hard CBF constraint for unconstrained inputs. A local-chart version handles angular or multi-valued auxiliary functions such as $\operatorname{atan2}$. Single-integrator, double-integrator, and nonholonomic unicycle examples illustrate the resulting radial–tangential construction and its local-chart and feasibility limitations.
Read the full abstract ▾
Optimization and Control
Real-time optimal delay minimization algorithms for aircraft on a same runway and dual runways
Peng Lin and Haopeng Yang
In this paper, scheduling problems of aircraft minimizing the total delays on a same runway and on dual runways are studied. In contrast to the
algorithms based on mixed-integer optimization models in existing works, where the optimality and the real-time performance are usually unable to be dealt with at the same time, our work focuses on the interaction mechanism between aircraft coupling with delays and two real-time optimal
algorithms are proposed for the four scheduling problems by fully exploiting the combinations of different classes of aircraft based on parallel computing technology. When $100$ aircraft on dual runways is considered, by using the
algorithm in this paper, the optimal solution can be obtained within less than $10$ seconds, while by using the CPLEX software to solve the mix-integer optimization model, the optimal solution cannot be obtained within $1$ hour.
Read the full abstract ▾
Combinatorics
Hypergraph Ramsey numbers with quasipolynomial growth rate
Xiaoyu He, Jiaxi Nie, Logan Post et al. (+1 more)
For a 3-uniform hypergraph (3-graph) $F$, let $r(F,n)$ be the smallest $N$ such that any $N$-vertex $F$-free 3-graph has an independent set of size $n$. We construct a $3$-graph $H_2$ with six vertices and five edges such that $r(H_2,n)=n^{\Theta(\log n)}$, and a more general family of $3$-graphs $F$ for which $r(F,n)=n^{\log^{\Theta(1)}(n)}$. These are the first examples of such Ramsey number known to be neither
polynomial nor exponential.
Read the full abstract ▾
All authors Xiaoyu He, Jiaxi Nie, Logan Post, Jacques Verstraëte
Optimization and Control
Strategies in POMDPs with Stage Duration
Ivan Novikov
Partially observable Markov decision processes (POMDPs) with stage duration provide a framework for approximating continuous-time behavior by scaling transition probabilities with a stage duration parameter $h \in (0,1]$. While previous literature has primarily focused on the limit of the discounted value as the stage duration $h$ vanishes, this paper investigates the global behavior of the asymptotic value, $V(h)$, across varying stage durations. Our main result demonstrates that any strategy in a POMDP with stage duration $h$ can be mimicked in the base POMDP ($h=1$). Specifically, we provide an explicit construction showing that for any strategy in the POMDP with stage duration $h$, there exists a strategy in the base POMDP that secures the same asymptotic payoff. As a consequence of this
theorem, we establish that the value function $V(h)$ is nondecreasing with respect to $h$, and that the continuous-time limit $\lim_{h \to 0} V(h)$ exists.
Read the full abstract ▾
Numerical Analysis
An immersed peridynamics method for fluid-driven damage and failure of anisotropic materials
Keon Ho Kim and Boyce E. Griffith
The immersed peridynamics (IPD) method is a fluid-structure interaction (FSI) model to simulate fluid-driven material damage and failure of an immersed structure, in which a peridynamic (PD) constitutive correspondence model is employed within a classical immersed boundary (IB)-type framework to describe stresses, forces, and structural deformations of a structural body, instead of classical continuum mechanics. This paper introduces an extension of the IPD method to simulate fluid-driven structural deformation, damage, and failure of anisotropic materials with complex geometries. We use quadrature rules attached to finite element (FE) meshes to generate both the PD points and their associated weights, which are used to approximate the PD integrals. We demonstrate that non-uniform discretizations improve both accuracy and volume conservation of hyperelastic materials along with accurately represented boundaries. To capture realistic biomaterial behaviors, we incorporate hyperelastic constitutive models including both isotropy and anisotropy into the proposed IPD method. In addition, a ductile failure model is adopted to simulate progressive damage and failure in anisotropic materials. For non-failure cases, our numerical simulations demonstrate that the extended IPD method yields comparable accuracy with similar numbers of structural degrees of freedom for different choices of peridynamic horizon sizes. For failure tests, we investigate the effect of a fiber orientation on deformations and failure processes using realistic biomaterial models with varying fiber directions. We further demonstrate that the developed method generates grid-converged simulations of damage growth, crack formation and propagation, and rupture under large deformations, including purely fluid-driven failure processes.
Read the full abstract ▾