相关论文: Fast evaluation of some p-adic transcendental func…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…

We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…

We propose a heuristic algorithm for fast computation of the Poincar\'{e} series $P_n(t)$ of the invariants of binary forms of degree $n$, viewed as rational functions. The algorithm is based on certain polynomial identities which remain to…

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

Numerical reconstruction techniques are widely employed in the calculation of multi-loop scattering amplitudes. In recent years, it has been observed that the rational functions in multi-loop calculations greatly simplify under partial…

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…

We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…

We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…

Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…

We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…

We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…

We analyze several generic proximal splitting algorithms well suited for large-scale convex nonsmooth optimization. We derive sublinear and linear convergence results with new rates on the function value suboptimality or distance to the…

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer…

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are…

We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…