Related papers: A posteriori superlinear convergence bounds for bl…
Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}^k$ in terms of the number and degrees of the defining polynomials has been an important problem in…
In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…
In the present study we consider an example of a boundary value problem for a simple second order ordinary differential equation, which may exhibit a boundary layer phenomenon. We show that usual central finite differences, which are second…
Stochastic gradient descent is one of the most common iterative algorithms used in machine learning and its convergence analysis is a rich area of research. Understanding its convergence properties can help inform what modifications of it…
This paper expands the Cyclic Block Proximal Gradient method for block separable composite minimization by allowing for inexactly computed gradients and proximal maps. The resultant algorithm, the Inexact Cyclic Block Proximal Gradient…
Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…
The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite…
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…
In this work, we propose a notion of practical learnability grounded in finite sample settings, and develop a conjugate learning theoretical framework based on convex conjugate duality to characterize this learnability property. Building on…
By employing non-equispaced grid points near boundaries, boundary-optimized upwind finite-difference operators of orders up to nine are developed. The boundary closures are constructed within a diagonal-norm summation-by-parts (SBP)…
In this paper, we provide a simple convergence analysis of proximal gradient algorithm with Bregman distance, which provides a tighter bound than existing result. In particular, for the problem of minimizing a class of convex objective…
In this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the degree of (higher) secant varieties to a given projective variety, which extends the well known lower bound for the degree of a variety in terms of…
We prove that the gradient of any bounded subharmonic function is upper semi-continuous, provided that its super-level sets can be touched from the exterior by uniform $C^{1,\text{Dini}}$ domains at every point. This idea extends to a class…
We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring…
Recent works by Bot-Fadili-Nguyen (arXiv:2510.22715) and by Jang-Ryu (arXiv:2510.23513) resolve long-standing iterate convergence questions for accelerated (proximal) gradient methods. In particular, Bot-Fadili-Nguyen prove weak convergence…
In this paper we study the a posteriori bounds for a conforming piecewise linear finite element approximation of the Signorini problem. We prove new rigorous a posteriori estimates of residual type in $L^{p}$, for $p \in (4,\infty)$ in two…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
In 2005, Li, Tao, Thiele and the author raised a general question concerning upper bounds for a class of multilinear oscillatory integral operators, and established such bounds in a few cases. Most cases remain open. The present paper is…
We place bounds on the order of enhanced discrete gauge symmetries that act on massless fields and thus arise at subloci of the moduli space in supergravity theories. We focus on supersymmetric theories with 8 or more supercharges which in…
We derive a new residual-type a posteriori estimator for a singularly perturbed reaction-diffusion problem with obstacle constraints. It generalizes robust residual estimators for unconstrained singularly perturbed equations. Upper and…