Functional Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 11 April
The objective of this article is to study nearly invariant subspaces of the backward shift operator on the real Hardy space. We also investigate nearly invariant subspaces with finite defect, and as a consequence, provide a characterization for almost invariant subspaces of the backward shift operator.
Statistics Theory · Cross-listed from econ.EM
Maximum score and non-smooth M-estimators with multiway dependence
Under i.i.d. sampling, the maximum score estimator of Manski (1975) converges at the cube-root rate to a non-Gaussian limit, and under median independence alone no regular estimator attains the parametric rate Chamberlain (1986). We show that, under multiway dependence and low-level conditions, the estimator is asymptotically normal at a parametric rate in the smallest number of clusters and, when the cluster-level variance is non-degenerate, as fast as regular estimators such as probit. The result rests on a general theory for non-smooth M-estimators, under which a modified bootstrap is first-order valid given a consistent Hessian estimate. With two-way clustering a cube-root term can remain. We then develop two-scale non-standard asymptotics, in which the limit is a Gaussian vector plus an independent Chernoff-type vector and either term may dominate, along sequences of laws from a non-degenerate cluster-level variance to the degenerate case. Under high-level conditions, the symmetric bootstrap intervals for suitable scalar parameters control size uniformly over such classes of laws, asymptotically exactly where the Gaussian term dominates and conservatively otherwise.
Read the full abstract
Combinatorics
Erdős-Gyárfás problem for partially ordered sets
Given integers $p,q,t$ with $1 \le t \le p$ and $1 \le q \le h_p(t)$, a strong $(p,q,t)$-coloring of the Boolean lattice $B_n$ is a coloring of its $t$-chains such that every induced copy of $B_p$ in $B_n$ uses at least $q$ colors on its $t$-chains. Let $f_t^{\sharp}(n,p,q)$ denote the minimum number of colors in such a coloring. We study this Boolean-lattice analogue of the Erdős-Gyárfás function.We first show that every finite poset strongly embeds into a Boolean lattice. Combined with a structural Ramsey theorem for finite posets with linear extensions, this implies the existence of the strong Boolean Ramsey number $\mathrm{R}^{\sharp}_{k,t}(\mathcal{B}\mid Q)$ for every integer $k\ge1$, every $t\ge1$, and every nonempty finite poset $Q$. In particular, this gives an affirmative answer to a problem of Cox and Stolee and yields the existence of $f_t^{\sharp}(n,p,2)$. Next, using the symmetric Lovász local lemma, we obtain a probabilistic upper bound on $f_t^{\sharp}(n,p,q)$. Finally, we prove lower bounds by combining Turán-type extremal estimates for $t$-chains, a double-counting argument, and a generalized Lubell-type framework for $t$-chains.
Read the full abstract
Combinatorics
The nonsymmetric compositional Delta theorem
Extending the symmetric framework of D'Adderio and Mellit, we establish a nonsymmetric generalization of the compositional Delta theorem. Building on Blasiak et al.'s theory of flagged LLT polynomials, we derive signed and unsigned nonsymmetric identities evaluated in terms of flagged LLT polynomials. Furthermore, by introducing nonsymmetric variants of the $\nabla$ and $\tau^*$ operators, we obtain a novel operator formulation. We show that applying Weyl symmetrization to these nonsymmetric identities systematically recovers the original compositional Delta theorem. Finally, we propose analogous conjectures regarding stable atom positivity.
Read the full abstract
Dynamical Systems
A Local Characterization of Unique Equilibrium States
We study when a prescribed ergodic measure is the unique equilibrium state of a continuous potential. For continuous actions of countably infinite discrete amenable groups on compact metric spaces with finite topological entropy, we characterize this property by a local condition on entropy differences. Fixing an ergodic measure $\mu$, we extend $h(\nu)-h(\mu)$ to the cone generated by the differences $\nu-\mu$, scaling the entropy difference by the same factor. We prove that $\mu$ is uniquely attainable if and only if this entropy difference function is weak\nobreakdash-$*$ upper semicontinuous at the zero measure. Upper semicontinuity of entropy at $\mu$ alone does not suffice. In fact, we construct a shift space over a compact alphabet for which entropy is upper semicontinuous at every ergodic measure and continuous at a measure supported on a fixed point, but this measure is not an equilibrium state of any continuous potential.
Read the full abstract
Combinatorics
Normality Of Quartic Cayley Graphs On Regular p-Groups: A CFSG-Free Approach
Relying on the Classification of Finite Simple Groups it was shown by Feng and Xu (Discrete Math., 2005) that every quartic Cayley graph of a regular $p$-group, $p \neq 2,5$, is normal. In this paper a CFSG-free proof of Feng-Xu theorem is given. Along the way it is also proved that for an arbitrary $p$-group $G$ with a minimum set $\{a,b\}$ of two generators, in the corresponding Cayley graph $\mathrm{Cay}(G,\{a,a^{-1},b,b^{-1}\})$ the induced action of vertex stabilizer on the neighbors' set is contained in the dihedral group $D_8$.
Read the full abstract
Numerical Analysis
Oblivious Subspace Injection Is Not Enough for Relative Error
Oblivious subspace injection (OSI) was introduced by Camaño, Epperly, Meyer, and Tropp in 2025 as a much weaker sketching property than oblivious subspace embedding (OSE) that still yields constant-factor guarantees for randomized low-rank approximation and sketch-and-solve least-squares regression. At the Simons Institute in Berkeley during a workshop in October 2025, it was asked whether OSIs also imply relative error bounds rather than just constant-factor guarantees. We show that, from a theoretical standpoint, OSI alone does not yield OSE-style relative-error guarantees whose failure probability is controlled solely by the OSI failure parameter, even though OSI sketches often perform extremely well in practice. We provide counterexamples showing this for sketch-and-solve least squares and for randomized SVD in the Frobenius norm. The missing ingredient from a sketch satisfying only OSI is upper control on the optimal residual or tail component, and when one ensures the sketch has this additional property, a near-relative-error bound is recovered. We also show that there is a natural $\ell_p$ analogue of OSI giving constant-factor sketch-and-solve bounds.
Read the full abstract
Probability
Large deviations for maximum local time of simple random walk in dimensions $d\ge 3$
We obtain sharp asymptotic probabilities for upward deviations of the maximum local time of discrete- and continuous-time simple random walks on $\mathbb{Z}^d$, $d\ge 3$. For downward deviations, we prove the sharp continuous-time asymptotics and the discrete-time upper bound. Together with the loop-pruning paper~\cite{li2026loopprune_inprep}, which proves the matching discrete-time lower bound via a loop-pruning construction, this yields the sharp downward-deviation asymptotics in discrete time as well. We also derive Gumbel-type consequences at the logarithmic scale.
Read the full abstract
Operator Algebras
On Essential and Topologically Essential Submodules of Hilbert C*-Modules
We study two notions of largeness for closed submodules of Hilbert C*-modules: essentiality and topological essentiality. While the analogous properties are known to be equivalent for closed two-sided ideals of C*-algebras, the one-sided case is more subtle. We prove that these two notions remain equivalent for closed right ideals of an arbitrary C*-algebra. Next, using the correspondence between submodules and right ideals of the algebra of compact operators, we extend this result to closed submodules of Hilbert C*-modules. In the commutative case, where a Hilbert module can be realized as a continuous field of Hilbert spaces, we give a geometric reformulation of essentiality and derive a fiberwise criterion.
Read the full abstract
Statistics Theory
Normalized Likelihood Criteria for Model Selection in the Stochastic Block Model
Estimating the number of communities is a fundamental problem in network analysis under the stochastic block model (SBM). In this paper, we study penalized estimators for this task based on normalized likelihood criteria. We show that a penalized estimator derived from the Normalized Maximum Likelihood (NML) is strongly consistent with a logarithmic penalty term, although its computation is intractable. To overcome this limitation, we consider the Normalized Maximum Complete Likelihood (NMCL) and the Decomposed Normalized Maximum Likelihood (DNML). The DNML admits an explicit formulation with cubic computational complexity in the number of nodes. We prove that the NMCL- and DNML- based estimators are strongly consistent for sparse networks in which the average node degree diverges with the network size. Empirical results show that the DNML estimator performs competitively with existing methods, particularly in unbalanced networks.
Read the full abstract
Information Theory · Cross-listed from eess.SP
Energy-Efficient Hybrid Data Computation via Coordinated AirComp and Edge Offloading
The development of 6G networks brings an increasing variety of data services, which motivates the hybrid computation paradigm that coordinates the over-the-air computation (AirComp) and edge computing for diverse and effective data processing. In this paper, we address this emerging issue of hybrid data computation from an energy-efficiency perspective, where the coexistence of both types induces resource competition and interference, and thus complicates the network management. Accordingly, we formulate the problem to minimize the overall energy consumption including the data transmission and computation, subject to the offloading capacity and aggregation accuracy. We then propose a block coordinate descent framework that decomposes and solves the subproblems including the user scheduling, power control, and transceiver scaling, which are then iterated towards a coordinated hybrid computation solution. Simulation results confirm that our coordinated approach achieves significant energy savings compared to baseline strategies, demonstrating its effectiveness in creating a well-coordinated and sustainable hybrid computing environment.
Read the full abstract
Combinatorics
Strong modules and asynchronous attractors of Boolean networks
We consider Boolean networks with interaction graphs partitioned into strongly connected components, which we call strong modules. This type of network decomposition has been considered in the literature, primarily from the perspective of attractor detection algorithms. In this paper, we aim to provide an algebraic basis for this line of research in the case of asynchronous Boolean networks. We prove that the asynchronous attractors of a network can be described as a dependent sum construction: as products of attractors of its controlled strong modules. We then show that a representation of all attractors can be computed in polynomial time under two conditions: the strong modules are small, and either the network is sparse or its defining functions have small size circuits (in particular when they are nested canalizing). We illustrate these results on a published Boolean model.
Read the full abstract
Algebraic Topology
Persistent Simple-homotopy invariants via discrete Morse theory
Persistent homology records the evolution of homological features along a filtration, but does not retain finer information related to simple-homotopy theory. In this paper, we develop two approaches to capturing such information for filtered simplicial complexes. We first introduce the Morse complexity profile, which records the minimal number of critical simplices at each filtration level. We study its invariance and stability properties and develop computable approximations using several discrete Morse matchings. We then introduce a persistent version of Whitehead torsion and show that it is invariant under both levelwise homotopy equivalence and interleaving equivalence of filtrations.
Read the full abstract
Optimization and Control
Policy Iteration for Stationary Discounted Hamilton–Jacobi–Bellman Equations: A Viscosity Approach
We study policy iteration (PI) for deterministic infinite-horizon discounted control problems characterized by stationary Hamilton–Jacobi–Bellman equations. For general viscosity solutions, the classical gradient-based policy improvement step need not be defined pointwise. We introduce a semi-discrete formulation with centered difference quotients at scale $h$ and a separate artificial-viscosity term of order $O(h)$. The resulting stencil is monotone, and the positive discount yields a resolvent contraction. Under bounded Lipschitz data and a globally Lipschitz minimizing policy map, we prove monotone and geometric convergence of the value iterates for each fixed $h>0$, together with a local quadratic estimate whose constant is of order $h^{-2}$. Under the additional condition $\lambda>\Lip_x(f)$, we establish $\|V^h-V\|_\infty\le C\sqrt h$ and combine the discretization and iteration errors into a quantitative bound. A bounded Lipschitz example shows that the $\sqrt h$ exponent is sharp for this scheme. The combined estimate gives a sufficient iteration count of order $h^{-1}\log(1/h)$ to attain an error of order $\sqrt h$. In bounded-domain experiments, the smooth one-dimensional benchmark exhibits the predicted discretization plateau, while a nonlinear two-dimensional manufactured benchmark isolates convergence to the discrete solution. Exact policy evaluation gives substantially faster local convergence than the global geometric bound. A neural evaluation diagnostic illustrates the importance of controlling boundary errors as well as interior residuals.
Read the full abstract
Optimization and Control
Byzantine-Robust Distributed SGD: A Unified Analysis and Tight Error Bounds
Byzantine-robust distributed optimization relies on robust aggregation rules to mitigate the influence of malicious Byzantine workers. Despite the proliferation of such rules, a unified convergence analysis framework that accommodates general data heterogeneity is lacking. In this work, we provide a thorough convergence theory of Byzantine-robust distributed stochastic gradient descent (SGD), analyzing variants both with and without local momentum. We establish the convergence rates for nonconvex smooth objectives and those satisfying the Polyak-Lojasiewicz condition under a general data heterogeneity assumption. Our analysis reveals that while stochasticity and data heterogeneity introduce unavoidable error floors, local momentum provably reduces the error component induced by stochasticity. Furthermore, we derive matching lower bounds to demonstrate that the upper bounds obtained in our analysis are tight and characterize the fundamental limits of Byzantine resilience under stochasticity and data heterogeneity. Empirical results support our theoretical findings.
Read the full abstract
Information Theory
A Modularized Framework for Piecewise-Stationary Restless Bandits
We study the piecewise-stationary restless multi-armed bandit (PS-RMAB) problem, where each arm evolves as a Markov chain but mean rewards may change across unknown segments. To address the resulting exploration–detection delay trade-off, we propose a modular framework that integrates arbitrary RMAB base algorithms with change detection and a novel diminishing exploration mechanism. This design enables flexible plug-and-play use of existing solvers and detectors, while efficiently adapting to mean changes without prior knowledge of their number. To evaluate performance, we introduce a refined regret notion that measures the excess regret due to exploration and detection, benchmarked against an oracle that restarts the base algorithm at the true change points. Under this metric, we prove a regret bound of $\tilde{O}(\sqrt{LMKT})$, where $L$ denotes the maximum mixing time of the Markov chains across all arms and segments, $M$ the number of segments, $K$ the number of arms, and $T$ the horizon. Simulations confirm that our framework achieves regret close to that of the segment oracle and consistently outperforms base solvers that do not incorporate any mechanism to handle environmental changes.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Digital Control of Negative Imaginary Systems Using Discrete-Time Multi-HIGS: Application to a Dual-Stage MEMS Force Sensor
In this paper, we propose a digital control approach for multi-input multi-output negative imaginary (NI) systems using discrete-time hybrid integrator-gain systems (HIGS) controllers. We show the NI property of the bimodal and trimodal discrete-time HIGS, as well as the parallel combinations of them, which are referred to as the multi-HIGS. Also, we demonstrate that linear NI systems can be asymptotically stabilized using discrete-time HIGS in digital control. We apply discrete-time bimodal and trimodal multi-HIGS controllers to a two-input two-output dual-stage force sensor with lightly damped resonant modes. To validate the theoretical findings, the closed-loop performance is evaluated in both time and frequency domains. Experimental results show that the discrete-time multi-HIGS effectively suppresses resonances while preserving favorable phase characteristics, which highlights its potential as a robust nonlinear NI controller for the digital control of NI systems.
Read the full abstract
Mathematical Physics
Dual contractions and algebraic families
We introduce a duality for Inönü-Wigner contractions attached to real symmetric Lie algebras. Starting from a symmetric pair $(\mathfrak{g},\theta)$, we define a dual real form $\mathfrak{g}^{*}$ inside the complexification of $\mathfrak{g}$ and consider the corresponding contraction with respect to the common fixed-point subalgebra $\mathfrak{g}^{\theta}$. The main result shows that the original contraction and its dual appear as real fibers of a single algebraic family of complex Lie algebras equipped with an anti-holomorphic involution. This places the two contractions in one geometric framework and connects them with the algebraic-family methods developed in recent work on contractions, real forms, and hidden symmetries.
Read the full abstract
Category Theory
On the (algebraic) notion of 2-ring
By a 2-ring we mean a groupoid with a structure analogous to that of a ring, up to coherent isomorphisms. Two different notions of 2-ring appear in the literature: the notion of Ann-category, due to Quang, and the notion of categorical ring, due to Jibladze and Pirashvili. The underlying data are the same in both cases, but the required axioms differ. In this note, we clarify the relationship between these notions by explaining why an additional axiom must be imposed for the two notions to be equivalent. Essential to this analysis is an equivalent description of a symmetric monoidal category.
Read the full abstract
Analysis of PDEs
Non-Hookean elasticity with arbitrary Poisson's ratios
In a previous paper \cite{Itskov-MoSM} we presented a hyperelastic isotropic material model whose stress-strain response is nonlinear even at infinitesimal deformations and cannot thus be linearized. As a result values of Poisson's ratio greater than one half were obtained. In this contribution, we further propose an isotropic strain energy function which is always positive-definite and depending on material constants delivers arbitrary values of Poisson's ratio (except of $-1$) in agreement with the laws of thermodynamics. The model response appears stable and plausible in various deformation states.
Read the full abstract
Probability
Harnack inequality for $p$-harmonic functions: probabilistic and analytic approaches
We survey analytic and probabilistic approaches to the Harnack inequality for $p$-harmonic functions, $p>1$, with particular attention to the dependence of the constants on $p$ and the dimension. We explain the ideas of Moser iteration, the tug-of-war approach of Luiro, Parviainen and Saksman, and the log-gradient estimate of Kotschwar and Ni. Along the way, we give a quantitative refinement of the probabilistic argument and a direct planar proof.
Read the full abstract
Analysis of PDEs
Asymptotic behavior of solutions to elliptic problems with Robin boundary conditions
In this paper, we investigate the asymptotic behavior, as $\beta \to 0$, of positive solutions to the semilinear elliptic Robin problem \begin{equation*} \begin{cases} -\Delta u = u^p, & \text{in } \Omega,\\ u > 0, & \text{in } \Omega,\\ \frac{\partial u}{\partial \nu} + \beta u = 0, & \text{on } \partial \Omega, \end{cases} \end{equation*} where $p \ge 0$, $\beta > 0$, and $\Omega$ is a bounded smooth domain. We will prove that, for all $p\ge0$, the solution $u_\beta$ behaves like a constant as $\beta\to0$. However, the value of this constant is strongly influenced by the value of $p$. Indeed, \begin{itemize} \item if $0 \le p < 1$, $u_\beta$ blows up uniformly in $\Omega$ as $\beta \to 0$. \item if $p=1$ (eigenvalue problem), $u_\beta$ converge to a constant. \item if $p>1$ $u_\beta$ converge uniformly to zero. \end{itemize} In the critical and supercritical regime $p \ge \frac{N+2}{N-2}$, the existence of solutions is no longer guaranteed a priori. In this case, when $\Omega$ is a ball and $0<\beta<\frac{2}{p-1}$ we prove the existence of a radial positive solution.
Read the full abstract
Information Theory
Finite-Blocklength Analysis of Alamouti Codes over Eisenstein Integers
We study a space–time block code from a maximal order in the definite quaternion algebra $(-1,-3)_{\Q}$. Its embedding into $\C^{2\times 2}$ yields an Alamouti–Eisenstein code over $\Z[w]$ with full diversity, orthogonality, and non-vanishing determinant. The underlying lattice is isomorphic to $\Z[w]^2$, while the embedded lattice has $A_2\oplus A_2$ geometry, yielding a hexagonal shaping gain. We compare it with the classical Alamouti code over $\Z[i]$ in terms of shaping, constellation-constrained mutual information, and finite-blocklength achievable rates, obtaining an asymptotic energy gain of about $0.79$~dB and a small but positive mutual-information gain. At the same SNR and rate, the Alamouti–Eisenstein design also improves short-packet reliability.
Read the full abstract
Dynamical Systems
On a Constraint on Invariant Measures of Certain Cellular Automata (Bi-Permutative and More)
In [10], a constraint on invariant measures of bi-permutative cellular automata has been observed. Its content was more or less as follows: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional probability at the zero index. When the alphabet is a finite group and the automaton is multiplication of two neighbors, that set is in fact a coset of some subgroup. In the present paper, we strengthen the formulations in [10] and investigate further the implications of this constraint. In the finite group case mentioned above, relations between some attributes of the group structure and the invariant measures are examined. We also inspect a factor that this constraint induces (we called it the structural factor), and analyze the special case in which it has zero measure-theoretical entropy, thus observing an interplay between existence of zero entropy invariant measures on that factor and existence of positive entropy measures corresponding to them on the original system. Then, we leave the setting of bi-permutative cellular automata and generalize our results to a wider class which we named RLP subshifts. The peculiar situation is that although this class may be much larger than the class of bi-permutative cellular automata, we found essentially only one other example in this class- the symbolic coding of the times 2 times 3 system on the circle (and its generalizations).
Read the full abstract
Representation Theory
Projectively Wakamatsu Tilting Modules over One-Point Extensions
Let $\Gamma = \Lambda[M]$ be the one-point extension of an algebra $\Lambda$ by a $\Lambda$-module $M$. We establish a method to lift projectively Wakamatsu tilting (PWT) modules from $\mathrm{mod}\,\Lambda$ to $\mathrm{mod}\,\Gamma$ by adding the new projective module, and prove that this lifting process perfectly preserves mutation relations under certain homological conditions. Furthermore, for source point extensions of representation-finite algebras, we obtain a complete classification of PWT $\Gamma$-modules in terms of those over $\Lambda$. In particular, we establish a bijection \[ \mathrm{PWT}(\Gamma) \longleftrightarrow \mathrm{PWT}(\Lambda) \coprod \mathrm{RPWT}(\Lambda, S_i). \] which yields the counting formula about $|\mathrm{PWT}(\Gamma)|$.
Read the full abstract
Spectral Theory
Complex analytic theory of Sturm-Liouville operators with Schatten $p$-class resolvents
We use the theory of entire functions of finite order to prove a universal spectral dependence of the blowup/decay rate of solutions of the Sturm-Liouville eigenvalue equation for problems with Schatten $p$-class resolvents. The general form of the asymptotics turns out to depend exclusively on the largest integer $\mathfrak{p}$ such that the underlying resolvents fail to be in the Schatten $\mathfrak{p}$-class. We then use the above result to construct a characteristic function of minimal order for Sturm-Liouville problems with Schatten $p$-class resolvents. This immediately yields contour integral representations of spectral $\zeta$-functions that were previously only known for quasi-regular problems (except for a few examples). We also demonstrate how our methods lead to new results in connection to important classic topics of Liouville-Green (or WKB) asymptotics and the approximation of the spectrum of singular problems via underlying truncated regular problems. All our applications are accompanied by illustrative examples, including the Airy differential equation, harmonic oscillator (and general power potentials), and the Laguerre differential equation.
Read the full abstract
Numerical Analysis
Improved error estimates of a new splitting scheme for charged-particle dynamics in strong magnetic field with maximal ordering
This paper introduces a novel second-order splitting scheme for charged-particle dynamics in strong magnetic fields characterized by the maximal ordering. The proposed scheme is explicit and symmetric, which respectively ensure the efficiency of the algorithm and its long-term near-conservation of energy. We rigorously prove that the scheme achieves improved error bounds for both the position and the velocity component parallel to the magnetic field, yielding a uniform second-order error bound under specific strong-field regimes. Numerical experiments confirm the optimal convergence rates and the long-term energy near conservation of the method.
Read the full abstract
Representation Theory
Non-solvable groups whose non-linear character degrees have the same number of different prime divisors
By a result of Noritzsch, a finite solvable group whose non-linear character degrees have the same set of prime divisors is meta-abelian. In this note we investigate finite non-solvable groups whose non-linear character degrees have the same number of different prime divisors, and show that up to an abelian direct factor, such groups are exactly $L_2(4), L_2(8), A_7, S_7$, the central product of a cyclic $3$-group with $3.A_7$, or the semi-direct product of $A_7$ by a cyclic $2$-group $\langle a\rangle$ such that $a$ non-trivially acts on $A_7$ by conjugation. As consequence, we show that only the primes $2,3,5,7$ may occur as prime divisors of their irreducible character degrees, and that Huppert's $\rho$-$\sigma$ conjecture holds for them.
Read the full abstract
Analysis of PDEs
Bifurcation of Tetrahedral Non-Zonal Flows in the 2D Euler Equations on a Rotating Sphere
We investigate the emergence of finite-amplitude non-zonal flows on the sphere $\mathbb{S}^2$ arising from stationary solutions to the 2D Euler equations. By restricting the Laplace-Beltrami eigenspace to the invariant subspace of the tetrahedral symmetry group $\mathbf{T}$, we bypass the $(2l+1)$-dimensional kernel degeneracy, obtaining a scalar Liapunov-Schmidt reduction. We analyze four distinct physical non-linearities: a polynomial model, the sine-Gordon and sinh-Gordon models, and the exponential (Liouville) model. We explicitly derive the bifurcation parameter via spectral projections, proving that the bifurcation topology (subcritical or supercritical) is not a geometric invariant, but is governed by the parity of the nonlinearity and the mass conservation.
Read the full abstract
Optimization and Control
A Bifidelity Proximal Quasi-Newton Method for Dense Rigid Body Suspension Collision Resolution
Direct numerical simulation of dense rigid body suspensions poses significant computational challenges. A popular approach to resolve collisions necessitates solving a linear complementary problem (LCP) per time step. Each matrix vector product (MVP) inside the LCP requires solving an expensive partial differential equation. In this work, we show the LCP can be solved efficiently, often in only three to four MVPs. Specifically, we develop a custom monofidelity proximal quasi-Newton (Mono-PQN) method and a bi-fidelity variant (Bi-PQN). Our approach is validated through an application to representative systems of dense Stokesian Janus particles. Notably, in contact resolution our Mono-PQN and Bi-PQN achieve $\approx 1.5 \times$ and $> 2 \times$ speed up respectively against a competitive baseline, with the latter method displaying robust, problem-size-independent convergence. For our largest simulation involving $216$ particles, our Bi-PQN cut total simulation runtime to five days, as compared to the eight days required by the prior state-of-the-art method.