Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 16 February
Koopman linear representations have become a popular tool for control design of nonlinear systems, yet it remains unclear when such representations are exact. In this paper, we establish sufficient and necessary conditions under which a controlled nonlinear system admits an exact finite-dimensional Koopman linear representation, which we term Koopman linear embedding. We show that such a system must be transformable into a special control-affine preserved (CAP) structure, which enforces affine dependence of the state on the control input and isolates all nonlinearities into an autonomous subsystem. We further prove that this autonomous subsystem must itself admit a finite-dimensional Koopman linear model with a sufficiently-rich Koopman invariant subspace. Finally, we introduce a symbolic procedure to determine whether a given controlled nonlinear system admits the CAP structure, thereby elucidating whether Koopman approximation errors arise from intrinsic system dynamics or from the choice of lifting functions.
Dynamical Systems
Homoclinic tangency of codimension 2 and historic wandering domains
We construct a four-dimensional diffeomorphism exhibiting a homoclinic tangency of the largest codimension, which admits a historic wandering domain of positive Lebesgue measure. Every orbit in this wandering domain exhibits historic behavior, in the sense that time averages do not converge. This example shows that homoclinic tangencies of the largest codimension can still give rise to positive Lebesgue measure sets with non-convergent statistical behavior.
Read the full abstract
Probability
Jucys–Murphy Elements for Wreath Products and Their Application to Dynamical Random Multi-Diagrams
The equivalence classes of irreducible representations of wreath product $\mathfrak{S}_n(T) = T^n \rtimes \mathfrak{S}_n$ of finite group $T$ with respect to symmetric group $\mathfrak{S}_n$ are parametrized by $\mathbb{Y}_n(\widehat{T})$, the $\lvert \widehat{T}\rvert$-tuple Young diagrams with total size $n$. We show a formula connecting the Kerov transition measures of these Young diagrams with the Jucys–Murphy elements of $\mathfrak{S}_n(T)$. This formula is due to Biane in the case of symmetric groups. The formula enables us to investigate asymptotic property of the shapes of multi-diagrams through combinatorial analysis for the Jucys–Murphy elements. On the other hand, a Markov chain is introduced on $\mathbb{Y}_n(\widehat{T})$, canonically reflecting the branching rule for the tower of wreath product groups. We have a continuous time stochastic process on $\mathbb{Y}_n(\widehat{T})$ from this chain by replacing the discrete time by a counting process. Our project is to specify the deterministic limit shape of multi-diagrams at each macroscopic time through appropriate space-time scaling limit, and to describe evolution of related quantities characterizing the shape. Especially, we derive dynamical concentrated limit shapes in the case of abelian $T$ by using free probability tools under the assumption of approximate factorization property for initial ensembles with an additional property of a pausing time distribution.
Read the full abstract
Differential Geometry
Gel'fand's inverse problem under Ricci curvature bounds
The classical Gel'fand's inverse problem asks whether a Riemannian manifold is uniquely determined by the knowledge of the heat kernel on any open subset of the manifold. We study this inverse problem in the non-smooth setting in the framework of ${\rm RCD}(K,N)$ spaces, namely, metric-measure spaces with synthetic Riemannian Ricci curvature bounded below by $K$ and dimension bounded above by $N$. We establish the unique solvability of Gel'fand's inverse problem for the class of compact ${\rm RCD}(K,N)$ spaces whose regular set admits Lipschitz Riemannian structure. As an application, we obtain the continuity of Gel'fand's inverse problem in the class of closed Riemannian manifolds with bounded Ricci curvature, diameter and volume bounded from below. We note that the results are new even for Einstein orbifolds and (weighted) Lipschitz Riemannian manifolds with non-smooth boundary.
Read the full abstract
Analysis of PDEs
Magnetic Neumann problems with Aharonov-Bohm potentials: boundary asymptotics of eigenvalues and splitting phenomena
We study a planar magnetic Schrödinger operator with an Aharonov-Bohm vector potential, under Neumann boundary conditions. Through a gauge transformation, the corresponding eigenvalue problem can be formulated in terms of the Laplacian on a fractured domain, where the fracture lies along the segment connecting the pole to its projection on the boundary. As the pole approaches the boundary, we prove that the eigenvalues converge to those of the Neumann Laplacian and the variation exhibits a logarithmic vanishing rate. In the case of multiple eigenvalues, when the pole approaches a fixed point of the boundary, we observe a splitting phenomenon, with the largest branch separating from the others.
Read the full abstract
Rings and Algebras
Rings in which the square of a unit is the sum of 1 and an element from $\sqrt{J(R)}$
Through this paper, we study the rings in which every unit's square is an element of the set $1+\sqrt{J(R)}$, and call them $2-\sqrt{J}U$ rings. Here, $\sqrt{J(R)}=\{x \in R: x^m \in J(R)$ for some $m \geq 1 \}$. We show that every $UU,~UJ,~2-UU,~2-UJ$ and $\sqrt{J}U$ ring is a $2-\sqrt{J}U$ ring. After exploring the basic properties, we show that the corner ring and unit closed subring of a $2-\sqrt{J}U$ ring are also $2-\sqrt{J}U$ rings. The ring of all $n\times n$ matrix rings for any $n>1$ is never a $2-\sqrt{J}U$ ring. We have focused on several other matrix extensions and group rings.
Read the full abstract
Numerical Analysis
Adaptive Finite Elements with Algebraic Stabilization for Convection-Dominated Transport
We present a numerical investigation of residual-based a posteriori error estimation for finite element discretizations of convection–diffusion equations stabilized by algebraic flux correction and related algebraic stabilization techniques. In particular, we consider AFC schemes employing the BJK and Monolithic Convex (MC) limiters and algebraically stabilized methods including MUAS, SMUAS, and the BBK approach. The performance of the estimators and limiters are studied on adaptively refined meshes for several two-dimensional test problems, including boundary layers, interior layers, and a nonlinear convection problem with solution-dependent transport. The experiments assess accuracy, preservation of the discrete maximum principle, adaptive mesh behaviour, and computational efficiency. The results show that the interaction between stabilization and a posteriori error estimation depends strongly on mesh alignment and on the character of the convection field. In particular, for problems with moving or curved layers, the behaviour of the limiters differs significantly: strongly upwind-biased limiters provide the most accurate solutions, while smoother algebraic stabilizations lead to more efficient nonlinear iterations. The study also indicates that residual-based estimators remain reliable for both linear and nonlinear problems but may react to changes in limiter activation during adaptive refinement. Overall, the numerical results clarify the practical behaviour of several widely used stabilization techniques within an adaptive framework and highlight aspects that are not yet fully explained by the current theory, particularly for nonlinear transport problems.
Read the full abstract
Combinatorics
k-Mutual Visibility in Graphs
In this paper, we introduce the notion of $k$-mutual visibility, a relaxation of classical mutual visibility in which every pair of selected vertices is joined by a shortest path containing at most $k$ internal vertices of the selected set. This parameterized concept naturally generalizes classical mutual visibility and provides a graded notion of obstruction tolerance. We define the $k$-mutual visibility number $\mu_k(G)$ and establish its fundamental properties. We derive bounds on $\mu_k(G)$ in terms of graph parameters such as diameter and girth, and determine its exact value for several fundamental graph classes. We further investigate $k$-mutual visibility in convex subgraphs and characterize it in block graphs by introducing the notion of $k$-admissible sets in the associated block-cutpoint tree. We present a polynomial-time algorithm, kMV, that recognizes whether a given subset $S\subseteq V(G)$ is a $k$-mutual visibility set of $G$. We also formulate the $k$-Mutual Visibility decision problem and prove that it is NP-complete. Finally, we define the $k$-mutual visibility covering number $\tau_k(G)$ and establish several of its fundamental properties.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Homological origin of the transversal implementability of logical diagonal gates in quantum CSS codes
Transversal Pauli Z rotations provide a natural route to fault-tolerant logical diagonal gates in quantum Calderbank-Shor-Steane (CSS) codes, but their capability is inherently constrained. We develop a homological framework that organizes transversal diagonal gates in terms of their logical action and physical implementation, revealing two layers of structure that govern their behavior. At a fixed level, we establish that their logical action admits a classification in terms of homological data of the underlying chain complex, extending the standard description of logical operators. We then formulate the refinement to finer angles as a lifting problem and derive two Bockstein-type obstruction maps, whose vanishing is a necessary and sufficient condition for the existence of a transversal logical diagonal gate at the next level. Within this framework, known algebraic conditions such as divisibility and triorthogonality are reinterpreted as necessary conditions for the existence of transversal logical diagonal gates with uniform rotation angles. Our results identify homological obstructions governing transversal implementability and provide a conceptual foundation for a formal theory of transversal structures in quantum error correction.
Read the full abstract
Probability
On Anti-Confinement Estimates for Self-Repelling Random Walks
We study a class of $d$-dimensional random walks, including the two-dimensional simple random walk, reweighted by a self-repelling Gibbsian pair potential. We prove lower bounds on the diffusion constant for short-range interactions, and superdiffusive behavior in case the interaction is sufficiently long-range. Finally, we show that in the superdiffusive regime, faster temporal decay can be compensated by stronger spatial repulsion and vice-versa. Our technique combines GKS-based correlation inequalities on path space with recursive multi-scale estimates.
Read the full abstract
Probability
Estimating $\pi$ with a Coin
We describe a simple Monte Carlo method for estimating $\pi$ by tossing a coin. Although the underlying Catalan-number series identities appear implicitly in the probability theory literature, the interpretation of $\frac{\pi}{4}$ presented here seems to be new.
History and Overview of Mathematics
Madhava's Pi-Series in the Modern Context
The $\pi$-series is attributed to Madhava, Gregory and Leibniz based on the chronology of its discovery. While this acknowledges the fact that Madhava of Sangamagrama an Indian mathematician who lived in Kerala in the 14th century along the banks of river Nila, was the first to discover the series, the modern day proof for the $\pi$-series is based on the outline of the proof given by the famous German mathematician Gottfried Wilhelm Leibniz in the 17th century, using concepts and rigorous definitions of Calculus many of which were developed after his lifetime. We extend the same benefit to Madhava's ideas and present Madhava's upapatti i.e proof for the $\pi$-series as given in Jyesthadeva's Yuktibhasha using modern notation and definitions. We elaborate Madhava's proof at three places (a) to prove that the arc-bit sum is same as the sum of arc-bit approximations (b) to prove convergence and (c) to concisely prove by iteration the power sum approximation. Madhava's method with appropriate changes can be applied to derive the sine and cosine series as well. Madhava also provides the correction terms to accelerate the convergence of the $\pi$-series. We compare the two proofs i.e Madhava's and the popular proof for $\pi$ which is based on Leibniz's ideas and observe that they are different since Madhava's is based on the length of the arc where as Leibniz's relies on the area under the arc and in terms of the number of concepts from advanced calculus used in the the two proofs Madhava's proof stands out for its simplicity, thus making a case for it to be appreciated, popularised and taught as the original proof of the $\pi$-series.
Read the full abstract
Combinatorics
Modular Nahm sums for symmetrizable matrices of indices $({2,\ldots, 2},1)$ and $({1,\ldots, 1},2)$
In this paper, we present three families of modular Nahm sums for symmetrizable matrices with arbitrary rank $r\geq 2$ of indices $({2,\ldots, 2},1)$ and $({1,\ldots, 1},2)$. Specifically, the cases corresponding to $r = 2$ and $r = 3$ of these families have been previously demonstrated by Mizuno, Warnaar, and B. Wang-L. Wang. Building upon these three families, we construct two vector-valued automorphic forms, one of which is a vector-valued modular function when $r$ is odd.
Read the full abstract
Information Theory
On the Rate-Distortion-Complexity Tradeoff for Semantic Communication
Semantic communication is a novel communication paradigm that focuses on conveying the user's intended meaning rather than the bit-wise transmission of source signals. One of the key challenges is to effectively represent and extract the semantic meaning of any given source signals. While deep learning (DL)-based solutions have shown promising results in extracting implicit semantic information from a wide range of sources, existing work often overlooks the high computational complexity inherent in both model training and inference for the DL-based encoder and decoder. To bridge this gap, this paper proposes a rate-distortion-complexity (RDC) framework which extends the classical rate-distortion theory by incorporating the constraints on semantic distance, including both the traditional bit-wise distortion metric and statistical difference-based divergence metric, and complexity measure, adopted from the theory of minimum description length and information bottleneck. We derive the closed-form theoretical results of the minimum achievable rate under given constraints on semantic distance and complexity for both Gaussian and binary semantic sources. Our theoretical results show a fundamental three-way tradeoff among achievable rate, semantic distance, and model complexity. Extensive experiments on real-world image and video datasets validate this tradeoff and further demonstrate that our information-theoretic complexity measure effectively correlates with practical computational costs, guiding efficient system design in resource-constrained scenarios.
Read the full abstract
Optimization and Control
Graph-Guided Fused Regularization for Single- and Multi-Task Regression on Spatiotemporal Data
Spatiotemporal matrix-valued data arise frequently in modern applications, yet performing effective regression analysis remains challenging due to complex, dimension-specific dependencies. In this work, we propose a regularized framework for spatiotemporal matrix regression that characterizes temporal and spatial dependencies through tailored penalties. Specifically, the model incorporates a fused penalty to capture smooth temporal evolution and a graph-guided penalty to promote spatial similarity. The framework also extends to the multi-task setting, enabling joint estimation across related tasks. We provide a comprehensive analysis of the framework from both theoretical and computational perspectives. Theoretically, we establish the statistical consistency of the proposed estimators. Computationally, we develop an efficient solver based on the Halpern Peaceman-Rachford method for the resulting composite convex optimization problem. The proposed algorithm achieves a fast global non-ergodic $\mathcal{O}(1/k)$ convergence rate with low per-iteration complexity. Extensive numerical experiments demonstrate that our method significantly outperforms state-of-the-art approaches in terms of predictive accuracy and estimation error, while also exhibiting superior computational efficiency and scalability.
Read the full abstract
Probability
Conditional Expectation expression in mean-field SDEs and its applications
This study developed a novel formulation of conditional expectations within the framework of a jump-diffusion mean-field stochastic differential equation. We introduce an integrated approach that combines unconditioned expectations with rigorously defined weighting factors, employing Malliavin calculus on Poisson space and directional derivatives to enhance estimation accuracy. \noindent The proposed method is applied to the numerical pricing of American put options in a jump-diffusion mean-field setting, addressing the challenges proposed by early-exercise features. Comprehensive numerical experiments demonstrate substantial improvements in pricing accuracy compared with conventional techniques.
Read the full abstract
Optimization and Control · Cross-listed from stat.ML
Constrained and Composite Sampling via Proximal Sampler
We study two log-concave sampling problems: constrained sampling and composite sampling. First, we consider sampling from a distribution proportional to $e^{-f}$ on a convex set $K\subset\mathbb R^d$, where $f$ is convex. Using an epigraph lifting, we reduce this problem to uniform sampling up to a one-dimensional exponential tilt over a convex set in $\mathbb R^{d+1}$. We then apply the proximal sampler to the lifted distribution. We develop an unbiased implementation of its restricted Gaussian oracle by using the cutting-plane method and rejection sampling, requiring only a separation oracle for $K$ and evaluation and subgradient oracles for $f$, without relying on projections or barrier functions. Second, we study composite sampling from $e^{-f-h}$, where $f$ and $h$ are closed and convex. This structure arises naturally in Bayesian inference, where $f$ represents data fidelity and $h$ encodes prior information. By applying an epigraph lifting to $h$, we reduce composite sampling to constrained sampling in $\mathbb R^{d+1}$, allowing us to build on the approach developed in the first part. This leads to a double lifting formulation in $\mathbb R^{d+2}$, for which we implement the proximal sampler using different combinations of subgradient and proximal oracles for $f$ and $h$. We establish mixing time bounds in Rényi and $\chi^2$ divergences for both problems. Finally, we revisit the convergence analysis of the proximal sampler from a variational perspective. Starting from variational formulations of its two half-steps as optimization problems over probability measures, we use a dynamic formulation of entropy-regularized optimal transport to recast them as optimal control problems. This allows us to derive their governing PDEs directly through the lens of optimization, without first analyzing particle-level SDEs.
Read the full abstract
Statistics Theory
Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
We study Gaussian Process Thompson Sampling (GP-TS) for sequential decision-making over compact, continuous action spaces and provide a frequentist regret analysis based on fractional Gaussian process posteriors, without relying on domain discretization as in prior work. We show that the variance inflation commonly assumed in existing analyses of GP-TS can be interpreted as Thompson Sampling with respect to a fractional posterior with tempering parameter $\alpha \in (0,1)$. We derive a kernel-agnostic regret bound expressed in terms of the information gain parameter $\gamma_t$ and the posterior contraction rate $\epsilon_t$, and identify conditions on the Gaussian process prior under which $\epsilon_t$ can be controlled. As special cases of our general bound, we recover regret of order $\tilde{\mathcal{O}}(T^{\frac{1}{2}})$ for the squared exponential kernel, $\tilde{\mathcal{O}}(T^{\frac{2\nu+3d}{2(2\nu+d)}} )$ for the Matérn-$\nu$ kernel, and a bound of order $\tilde{\mathcal{O}}(T^{\frac{2\nu+3d}{2(2\nu+d)}})$ for the rational quadratic kernel. Overall, our analysis provides a unified and discretization-free regret framework for GP-TS that applies broadly across kernel classes.
Read the full abstract
Functional Analysis
A new collection of $n-$tuple operator inequalities
In this paper, we present several new bounds for the norm and numerical radius of sums of Hilbert space operators. The obtained bounds form a new collection that enriches our understanding of these bounds. We compare our bounds with the existing literature using examples that demonstrate, in general, how our results are incomparable with the known bounds. Of particular interest are the treatment of the triangle inequality, the numerical radius of operator matrices, and singular value bounds for sums of operators.
Read the full abstract
Functional Analysis
Integral Numerical Radius and Operator Matrix Bounds
We establish new integral inequalities for the numerical radius and the operator norm of bounded linear operators on Hilbert spaces. Our results refine classical triangle-type and operator matrix inequalities by incorporating convex combinations and integral averaging techniques. Several consequences, including new identities, sharper bounds, and equality conditions, are obtained, revealing deeper structural connections between the numerical radius and operator norm.
Read the full abstract
Numerical Analysis · Cross-listed from hep-lat
Mixed precision solvers with half-precision floating point numbers for Lattice QCD on A64FX processor
We investigate the use of half-precision floating-point numbers (FP16) in mixed-precision linear solvers for lattice QCD simulations. Since the emergence of GPUs for general-purpose, mixed-precision algorithms that combine single-precision (FP32) with double-precision (FP64) arithmetics have become widely used in this field and others. While FP32-based methods are now well established, we examine the practicality of using FP16. In this work, we introduce rescaling steps in both the outer iterative refinement step and the inner BiCGStab solver to avoid numerical instability. In our experiments with a simple Wilson kernel, the solver shows improved stability, and the additional iteration count compared to the FP64 version remains within 20%, indicating that the FP16 version is practical for use. We believe that the proposed rescaling methods can also benefit other mixed precision preconditioners in avoiding underflows.
Read the full abstract
Numerical Analysis
On Two-Stage Householder Orthogonalization
Two-stage orthogonalization is essential in numerical algorithms such as Krylov subspace methods. For this task we need to orthogonalize a matrix $A$ against another matrix $V$ with orthonormal columns. A common approach is to employ the block Gram–Schmidt algorithm. However, its stability largely depends on the condition number of $[V,A]$. While performing a Householder orthogonalization on $[V,A]$ is unconditionally stable, it does not utilize the knowledge that $V$ has orthonormal columns. To address these issues, we propose a two-stage Householder orthogonalization algorithm based on the generalized Householder transformation. Instead of explicitly orthogonalizing the entire $V$, our algorithm only needs to orthogonalizes a square submatrix of $V$. Theoretical analysis and numerical experiments demonstrate that our method is also unconditionally stable.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Holographic Subregion Complexity and Fidelity Susceptibility in Noncommutative Yang–Mills Theory
We analyze the behavior of holographic subregion complexity (HSC) and holographic fidelity susceptibility (HFS) in noncommutative Yang–Mills theory. The emergence of a minimum length scale, dictated by the degree of noncommutativity, induces a behavioral transition in the HSC and establishes a lower bound. In the large noncommutativity regime, the qualitative features of the complexity deviate significantly from the commutative case. The HFS is shown to provide an effective measure of the degree of noncommutativity. Although the HSC generally satisfies strong subadditivity, this property fails abruptly when the subregion size approaches the minimum length scale. At finite temperature, the long-range behavior of the HSC is modified, and its lower bound scales positively with temperature. Furthermore, temperature enhances the sensitivity of the fidelity susceptibility to the degree of noncommutativity. Within the AdS soliton background, a competition between connected and disconnected configurations arises in the HSC, signaling a phase-transition-like behavior. Finally, the compactification scale is found to diminish the sensitivity of the HFS to the degree of noncommutativity.
Read the full abstract
Number Theory
Tribonacci Numbers That Are Products of Two Lucas Numbers
Let $T_{k}$ be the $k^{\textrm{th}}$ Tribonacci number and $L_{n}$ be the $n^{\textrm{th}}$ Lucas number defined by their respective recurrence relation $T_{k}=T_{k-1}+T_{k-2}+T_{k-3}$ and $L_{n}=L_{n-1}+L_{n-2}$. In this study, we solve the Diophantine equation $T_{k} = L_{m}L_{n}$ for positive integer unknowns $m$, $n$, and $k$ and prove our results.
Read the full abstract
Category Theory
The higher algebra and geometry of monoidal bicategories
We show that braided, sylleptic and symmetric monoidal bicategories are precisely the $\mathsf{E}_k$-monoids in the cartesian monoidal $(\infty,1)$-category of bicategories for respective integers $k$. To manage the underlying computations, we use the geometry of the little cubes operads to mediate between the 2-dimensional algebra underlying the former and the $\infty$-categorical algebra underlying the latter.
Read the full abstract
Rings and Algebras
The higher order group inverse in a ring
This paper introduces and studies the higher-order group inverse in a ring. We extend known properties of the higher-order group inverse from complex matrices to elements of a ring and, in the process, derive new results. We further characterize when a ring element can be expressed as the sum of a higher-order group element and a nilpotent element.
Read the full abstract
Information Theory · Cross-listed from eess.SP
Reconfigurable Intelligent Surfaces-assisted Positioning in Integrated Sensing and Communication Systems
This paper investigates the problem of high-precision target localization in integrated sensing and communication (ISAC) systems, where the target is sensed via both a direct path and a reconfigurable intelligent surface (RIS)-assisted reflection path. We first develop a sequential matched-filter estimator to acquire coarse angular parameters, followed by a range recovery process based on subcarrier phase differences. Subsequently, we formulate the target localization problem as a non-linear least squares optimization, using the coarse estimates to initialize the target's position coordinates. To solve this efficiently, we introduce a fast iterative refinement algorithm tailored for RIS-aided ISAC environments. Recognizing that the signal model involves both linear path gains and non-linear geometric dependencies, we exploit the separable least-squares structure to decouple these parameters. Furthermore, we propose a modified Levenberg algorithm with an approximation strategy, which enables low-cost parameter updates without necessitating repeated evaluations of the full non-linear model. Simulation results show that the proposed refinement method achieves accuracy comparable to conventional approaches, while significantly reducing algorithmic complexity.
Read the full abstract
Analysis of PDEs
The small Deborah number limit for the compressible fluid-particle flows
In this paper, we consider the hydrodynamic limit for the fluid-particle flows governed by the Vlasov-Fokker-Planck equation coupled with the compressible Navier-Stokes equation as the Deborah number tends to zero. The proof is based on a formal derivation via the Hilbert expansion around the limiting system, the rigorous justification of which is completed by the refined energy estimates involving the macro-micro decomposition. Compared with the existing results obtained by the relative entropy argument ([A. Mellet and A. F. Vasseur, Comm. Math. Phys., 281 (2008), pp. 573-596]), the present work extends to a pointwise convergence of the hydrodynamic limits with an explicit rate for the fluid-particle coupled model.
Read the full abstract
Numerical Analysis
A convergent finite element method with minimal deformation rate for mean curvature flow
We propose and analyze a fully discrete parametric finite element method with minimal deformation rate (MDR) for simulating the mean curvature flow of general closed surfaces in three dimensions. The method is formulated from a coupled system that enforces the mean curvature flow law for the normal velocity while introducing an artificial tangential velocity that minimizes the deformation-rate energy, thereby preserving mesh quality without requiring remeshing or reparametrization. An $L^{2}$-projected averaged normal vector is used in the scheme to facilitate a rigorous convergence analysis. Within the projected–distance framework, we establish the first complete convergence proof for a parametric finite element method that incorporates the MDR tangential motion without relying on evolution equations for the mean curvature or the normal vector, achieving optimal-order error estimates for finite elements of degree $k \ge 3$. Numerical experiments corroborate the theoretical results and demonstrate that the proposed MDR method maintains mesh quality comparable to the Barrett–Garcke–Nürnberg method, for which convergence has not yet been established.
Read the full abstract
Probability
Uniform-in-time propagation of chaos for consensus-based minimax algorithm
We study the large-population convergence of a consensus-based algorithm for the saddle point problem proposed by ArXiv: 2212.12334, establishing the uniform-in-time propagation of chaos using a coupling method. Our work shows that the $L^2$-deviation has order $O(N_1^{-1} + N_2^{-1})$ uniformly in time, where $N_1$ and $N_2$ denote the numbers of particles corresponding to the two competing players. It demonstrates the convergence of the particles to some location near a saddle point of the given objective function, which confirms the computational feasibility of the algorithm. The main idea behind the proofs is the exponential decay and the concentration of the variances of the particle system.