Related papers: An Algorithm Computing the Local $b$ Function by a…
We present a new fast algorithm for computing the Boys function using a nonlinear approximation of the integrand via exponentials. The resulting algorithms evaluate the Boys function with real and complex valued arguments and are…
We study the allocation problem in the Massively Parallel Computation (MPC) model. This problem is a special case of $b$-matching, in which the input is a bipartite graph with capacities greater than $1$ in only one part of the bipartition.…
In min-min optimization or max-min optimization, one has to compute the gradient of a function defined as a minimum. In most cases, the minimum has no closed-form, and an approximation is obtained via an iterative algorithm. There are two…
An algorithm is presented for approximating arbitrary powers of a black box unitary operation, $\mathcal{U}^t$, where $t$ is a real number, and $\mathcal{U}$ is a black box implementing an unknown unitary. The complexity of this algorithm…
In probability theory, the partition function is a factor used to reduce any probability function to a density function with total probability of one. Among other statistical models used to represent joint distribution, Markov random fields…
Convex optimization has become ubiquitous in most quantitative disciplines of science, including variational image processing. Proximal splitting algorithms are becoming popular to solve such structured convex optimization problems. Within…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
Suppose $f : [0,1]^2 \rightarrow \mathbb{R}$ is a $(c,\alpha)$-mixed H\"older function that we sample at $l$ points $X_1,\ldots,X_l$ chosen uniformly at random from the unit square. Let the location of these points and the function values…
This paper introduces a factorization for the inverse of discrete Fourier integral operators that can be applied in quasi-linear time. The factorization starts by approximating the operator with the butterfly factorization. Next, a…
The only known constructive factorization algorithm for linear partial differential operators (LPDOs) is Beals-Kartashova (BK) factorization \cite{bk2005}. One of the most interesting features of BK-factorization: at the beginning all the…
The notion of a local fractional derivative (LFD) was introduced recently for functions of a single variable. LFD was shown to be useful in studying fractional differentiability properties of fractal and multifractal functions. It was…
We propose and develop a new calculus for local variational differential operators. The main difference of the new formalism with the canonical differential calculus is that the image of higher order operators on local functionals does not…
We study the applicability of distributed, local algorithms to 0/1 max-min LPs where the objective is to maximise ${\min_k \sum_v c_{kv} x_v}$ subject to ${\sum_v a_{iv} x_v \le 1}$ for each $i$ and ${x_v \ge 0}$ for each $v$. Here $c_{kv}…
We give a new algorithm to find local maximum and minimum of a holonomic function and apply it for the Fisher-Bingham integral on the sphere $S^n$, which is used in the directional statistics. The method utilizes the theory and algorithms…
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…
In this paper, we present a method for the accurate estimation of the derivative (aka.~sensitivity) of expectations of functions involving an indicator function by combining a stochastic algorithmic differentiation and a regression. The…
The investigation of partitions of integers plays an important role in combinatorics and number theory. Among the many variations, partitions into powers $0<\alpha<1$ were of recent interest. In the present paper we want to extend our…
We obtain order estimates of approximation of classes $B^{\Omega}_{p,\theta}$ of periodic functions of many variables in the space $L_q$ by using operators of orthogonal projection as well as linear operators subjected to some conditions.
The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…
Let $0 \leq \alpha<n$, $M_{\alpha}$ be the fractional maximal operator, $M^{\sharp}$ be the sharp maximal operator and $b$ be the locally integrable function. Denote by $[b, M_{\alpha}]$ and $[b, M^{\sharp}]$ be the commutators of the…