Related papers: Approximations to -, di- and tri- logarithms
By assuming some widely-believed arithmetic conjectures, we show that the task of accepting a number that is representable as a sum of $d\geq2$ squares subjected to given congruence conditions is NP-complete. On the other hand, we develop…
We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure math- ematics and string theory. We then…
This paper offers a newly created integral approach for operators employing the orthogonal modified Laguerre polynomials and P\u{a}lt\u{a}nea basis. These operators approximate the functions over the interval $[0,\infty)$. Further, the…
We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…
Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of a feasible solution by the image of some solution in the…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
In this talk we discuss the solution for the sunrise integral around two and four space-time dimensions in terms of a generalised elliptic version of the multiple polylogarithms. In two space-time dimensions we obtain a sum of three…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
We describe an expansion of Legendre polynomials, analogous to the Taylor expansion, to approximate arbitrary functions. We show that the polynomial coefficients in Legendre expansion, therefore the whole series, converge to zero much more…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
We give a combinatorial interpretation for the hypergeometric functions associated with tuples of rational numbers.
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
Feynman integrals appropriately generalized are $\mathsf A$-hypergeometric functions. Among the properties of $\mathsf A$-hypergeometric functions are symmetries associated with the Newton polytope. In ordinary hypergeometric functions…
This paper gives an explicit formula for the Ehrhart quasi-polynomial of certain 2-dimensional polyhedra in terms of invariants of surface quotient singularities. Also, a formula for the dimension of the space of quasi-homogeneous…
A method of local approximation of holomorphic solutions of algebraic equations is discussed
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
A short review of the method for the tensor reduction of Feynman integrals based on recurrence relations with respect to space-time dimension d- is given. A solution of the difference equation with respect to d for the n - point one-loop…