Related papers: Computation of Zolotarev rational functions
This work shows that for rational multivariate functions, the Kolmogorov Superposition Theorem (KST) involves several single-variable functions, which can be written down by inspection. In other words, no computation is required for…
Symbolic summation as an active research topic of symbolic computation provides efficient algorithmic tools for evaluating and simplifying different types of sums arising from mathematics, computer science, physics and other areas. Most of…
Let $N$ be a positive integer. We say a non-constant rational function $U(x)\in{\mathbb C}(x)$ is $N$-\emph{unital} if all the zeros and poles of both $U(x)$ and $1-U(x)$ are either 0 or $N$-th roots of unity. These functions are called…
Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4 {\log}^{O(1)}…
An algorithm $M$ is described that solves any well-defined problem $p$ as quickly as the fastest algorithm computing a solution to $p$, save for a factor of 5 and low-order additive terms. $M$ optimally distributes resources between the…
In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set defined by finitely many polynomial inequalities. More…
We study high dimensional integration in the quantum model of computation. We develop quantum algorithms for integration of functions from Sobolev classes $W^r_p([0,1]^d)$ and analyze their convergence rates. We also prove lower bounds…
In this note we give an algorithm to determine the rational homotopy type of the free and pointed mapping spaces $ map(F(\mathbb R^m,k), S^n)$ and $ map^*(F(\mathbb R^m,k), S^n)$. An explicit description of these spaces is given for $k=3$.…
Let $\Re_n$ be the set of all rational functions of the type $r(z) = p(z)/w(z),$ where $p(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-a_j)$, $|a_j|>1$ for $1\leq j\leq n$. In this paper, we set up some results…
In this note we axiomatize the classes of rudimentary functions, primitive recursive functions, safe recursive set functions, and predicatively computable functions.
In the article we outline the set of Matlab functions that enable the computation of elliptic Integrals and Jacobian elliptic functions for real arguments. Correctness, robustness, efficiency and accuracy of the functions are discussed in…
Functional equations (FE) arise quite naturally in the analysis of stochastic systems of different kinds : queueing and telecommunication networks, random walks, enumeration of planar lattice walks, etc. Frequently, the object is to…
Potential theory for rational approximation is reviewed by means of examples computed with the AAA algorithm.
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…
Let $\mathcal{P} \subseteq \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a…
The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.
New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…
A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…
This paper develops a simple calculus for order of magnitude reasoning. A semantics is given with soundness and completeness results. Order of magnitude probability functions are easily defined and turn out to be equivalent to kappa…