Related papers: Computing Limits of Quotients of Multivariate Real…

Leibniz's rule for the $n$-th derivative of a product is a very well known and extremely useful formula. In this article, we introduce an analogous explicit formula for the $n$-th derivative of a quotient of two functions. Later, we use…

We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…

Let P(z) and Q(y) be polynomials of the same degree k>=1 in the complex variables z and y, respectively. In this extended abstract we study the non-linear functional equation P(z)=Q(y(z)), where y(z) is restricted to be analytic in a…

In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…

We provide a general algorithm for the computation of the unramified Brauer group of quotients of rational varieties by finite groups.

We present an overview of the existing methods for computing functional determinants, and outline a possible way forward for Hamiltonians of higher dimensions without radial symmetry.

An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…

For the generalized eigenvalue problem, a quotient function is devised for estimating eigenvalues in terms of an approximate eigenvector. This gives rise to an infinite family of quotients, all entirely arguable to be used in estimation.…

We discuss the best methods available for computing the gamma function $\Gamma(z)$ in arbitrary-precision arithmetic with rigorous error bounds. We address different cases: rational, algebraic, real or complex arguments; large or small…

We show that unary log-analytic functions are polynomially bounded. In the higher dimensional case globally a log-analytic function can have exponential growth. We show that a log-analytic function is polynomially bounded on a definable set…

We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

We investigate the quantum Cramer-Rao bounds on the joint multiple-parameter estimation with the Gaussian state as a probe. We derive the explicit right logarithmic derivative and symmetric logarithmic derivative operators in such a…

We present a new way of organizing the few mathematical statements which form introduction to Calculus: the epsilon-delta characterization of the limit is now d e r i v e d from four simple, intuitive and frequently used statements, which…

We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…

The asymptotic behavior of stochastic gradient algorithms is studied. Relying on results from differential geometry (Lojasiewicz gradient inequality), the single limit-point convergence of the algorithm iterates is demonstrated and…

We use spectral decimation to provide formulae for computing the harmonic gradients of Laplacian eigenfunctions on the Sierpinski Gasket. These formulae are given in terms of special functions that are defined as infinite products.

Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…

This paper identifies necessary and sufficient conditions for the exactness of penalty functions in optimization problems whose constraint sets are not necessarily bounded. The case where the data of problems is locally Lipschitz,…

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…