Related papers: Watson resummation of a class of Hausdorff-transfo…
We study composite optimization problems in which the smooth part of the objective function is \( p \)-times continuously differentiable, where \( p \geq 1 \) is an integer. Higher-order methods are known to be effective for solving such…
In this work, we study the resurgence program in holomorphic quantum mechanics. As a specific problem, we investigate the resurgence in the quartic anharmonic oscillator within holomorphic quantum mechanics, using the Bargmann…
One of the most attractive recent approaches to processing well-structured large-scale convex optimization problems is based on smooth convex-concave saddle point reformu-lation of the problem of interest and solving the resulting problem…
We consider the distribution of polygonal paths joining the partial sums of normalized Kloosterman sums modulo an increasingly high power p^n of a fixed odd prime p, a pure depth-aspect analogue of theorems of Kowalski-Sawin and…
We give an algorithm to compute term by term multivariate Puiseux series expansions of series arising as local parametrizations of zeroes of systems of algebraic equations at singular points. The algorithm is an extension of Newton's method…
We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…
We develop a high accuracy power series method for solving partial differential equations with emphasis on the nonlinear Schr\"odinger equations. The accuracy and computing speed can be systematically and arbitrarily increased to orders of…
When a sequence of numbers is slowly converging, it can be transformed into a new sequence which, under some assumptions, could converge faster to the same limit. One of the most well--known sequence transformation is Shanks transformation…
In this note, we introduce a unified analytic framework that connects simple varieties of trees, Bienayme-Galton-Watson processes and Khinchin families. Using Lagrange's inversion formula, we derive new coefficient-based expressions for…
We explicitly construct the series expansion for a certain class of solutions to the 2D Toda hierarchy in the zero dispersion limit, which we call symmetric solutions. We express the Taylor coefficients through some universal combinatorial…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
A novel recurrence formula for moments with respect to M\"{u}ntz-Legendre polynomials is proposed and applied to construct a numerical method for solving generalized Gauss quadratures with power function weight for M\"{u}ntz systems. These…
As was initially shown by Brent, exponentials of truncated power series can be computed using a constant number of polynomial multiplications. This note gives a relatively simple algorithm with a low constant factor.
Unlike the matrix case, computing low-rank approximations of tensors is NP-hard and numerically ill-posed in general. Even the best rank-1 approximation of a tensor is NP-hard. In this paper, we use convex optimization to develop…
This paper revisits the Polyak step size schedule for convex optimization problems, proving that a simple variant of it simultaneously attains near optimal convergence rates for the gradient descent algorithm, for all ranges of strong…
This article develops the numerical and theoretical study of a reconstruction algorithm of a potential in a wave equation from boundary measurements, using a cost functional built on weighted energy terms coming from a Carleman estimate.…
The classical phase retrieval problem involves estimating a signal from its Fourier magnitudes (power spectrum) by leveraging prior information about the desired signal. This paper extends the problem to compact groups, addressing the…
We have evaluated perturbation coefficients of Wilson loops up to $O(g^8)$ for the four-dimensional twisted Eguchi-Kawai model using the numerical stochastic perturbation theory (NSPT) in arXiv:1902.09847. In this talk we present a progress…
We revisit the Ou-Wang's approach to the cone restriction problem via polynomial partitioning. By recasting their inductive scheme as a recursive algorithm and incorporating the nested polynomial Wolff axioms, we obtain improved bounds for…
We introduce a family of fourth order two-step methods that preserve the energy function of canonical polynomial Hamiltonian systems. Each method in the family may be viewed as a correction of a linear two-step method, where the correction…