相关论文: Fast Evaluation of Zolotarev Coefficients
We review the theory of optimal polynomial and rational Chebyshev approximations, and Zolotarev's formula for the sign function over the range (\epsilon \leq |z| \leq1). We explain how rational approximations can be applied to large sparse…
An algorithm is presented to compute Zolotarev rational functions, that is, rational functions $r_n^*$ of a given degree that are as small as possible on one set $E\subseteq\complex\cup\{\infty\}$ relative to their size on another set…
Elliptic functions are largely studied and standardized mathematical objects. The two usual approaches are due to Jacobi and Weierstrass. From a contour integral which allowed us to unify many summation formulae (Euler-MacLaurin, Poisson,…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
We consider an elliptic system of equations on the torus $\left[ -\frac{L}{2}, \frac{L}{2} \right)^d$ with random coefficients $A$, that are assumed to be coercive and stationary. Using two different approaches we obtain moment bounds on…
We consider multiply periodic functions, sometimes called Abelian functions, defined with respect to the period matrices associated with classes of algebraic curves. We realise them as generalisations of the Weierstras P-function using two…
The paper gives a survey of the modern results on elliptic problems on the H\"ormander function spaces. More precisely, elliptic problems are studied on a Hilbert scale of the isotropic H\"ormander spaces parametrized by a real number and a…
In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…
We introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise…
In this work, we are presenting an efficient way to compute the geometric mean of two positive definite matrices times a vector. For this purpose, we are inspecting the application of methods based on Krylov spaces to compute the square…
This paper proposes an efficient method for computing selected generalized eigenpairs of a sparse Hermitian definite matrix pencil $(A,B)$. Based on Zolotarev's best rational function approximations of the signum function and conformal…
The elliptic gamma function is a generalization of the Euler gamma function and is associated to an elliptic curve. Its trigonometric and rational degenerations are the Jackson q-gamma function and the Euler gamma function, respectively.…
Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation…
We establish that a generalized H\"{o}lder continuous function on an $(m-2)$-Ahlfors regular compact set in $\mathbb{R}^m$ can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity…
We show how to calculate particular values of the Gamma function for specific rational arguments in the interval (0,1) without using the Elliptic K-function. Instead we use transcendental constants or periods defined by hyperelliptic…
We continue our study of the construction of analytical coefficients of the epsilon-expansion of hypergeometric functions and their connection with Feynman diagrams. In this paper, we apply the approach of obtaining iteratated solutions to…
Motivated by connections to random matrices, Littlewood-Richardson coefficients and tilings, we study random discrete concave functions on an equilateral lattice. We show that such functions having a periodic Hessian of a fixed average…
We study the iterative algorithm proposed by S. Armstrong, A. Hannukainen, T. Kuusi, J.-C. Mourrat to solve elliptic equations in divergence form with stochastic stationary coefficients. Such equations display rapidly oscillating…
This is author's Habilitation Thesis (Dr. Sci. dissertation) submitted at the beginning of September 2004. It is written in Russian and is posted due to the continuing requests for the manuscript. The content: 1. Introduction, 2. Nonlinear…
We present new ideas for computing elliptic Gau{\ss} sums, which constitute an analogue of the classical cyclotomic Gau{\ss} sums and whose use has been proposed in the context of counting points on elliptic curves and primality tests. By…