Related papers: Numerical Evaluation of Elliptic Functions, Ellipt…
We use some general properties, presented in previous work, to evaluate special cases of integrals relating Rogers-Ramanujan continued fraction, eta function and elliptic integrals.
The Mathieu functions are used to solve analytically some problems in elliptical cylinder coordinates. A computational toolbox was implemented in Matlab. Since the notation and normalization for Mathieu functions vary in the literature, we…
We introduce data structures and algorithms to count numerical inaccuracies arising from usage of floating numbers described in IEEE 754. Here we describe how to estimate precision for some collection of functions most commonly used for…
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…
The complete elliptic integral of the first kind (CEI-1) plays a significant role in mathematics, physics and engineering. There is no simple formula for its computation, thus numerical algorithms are essential for coping with the practical…
This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…
Our object of study is extremal functions which are defined by distance functions of convex bodies. These functions take values in the moduli spaces of algebraic and geometric objects associated with these ${\mathbb Z}$-modules (geometric…
This paper studies the numerical computation of integrals, representing estimates or predictions, over the output $f(x)$ of a computational model with respect to a distribution $p(\mathrm{d}x)$ over uncertain inputs $x$ to the model. For…
This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
The aim of this article is to give a generalization of the Cauchy-Pompeiu integral formula for functions valued in parameter-depending elliptic algebras with structure polynomial $X^2 + \beta X + \alpha$ where $\alpha$ and $\beta$ are real…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…
The umbral restyling of hypergeometric functions is shown to be a useful and efficient approach in simplifying the associated computational technicalities. In this article, the authors provide a general introduction to the umbral version of…
Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…
By a change of variables we obtain new $y$-coordinates of elliptic curves. Utilizing these $y$-coordinates as modular functions, together with the elliptic modular function, we generate the modular function fields of level $N\geq3$.…
We give a comprehensive treatment of the transformation laws of theta functions from an algebro-geometric perspective, that is, in terms of moduli of abelian schemes. This is accomplished by introducing geometric notions of theta-descent…
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums),…
We study the algebraic and geometric properties of the integral closure of different rings of functions on a real algebraic variety : the regular functions and the continuous rational functions.
We study the problem of fitting circles (or circular arcs) to data points observed with errors in both variables. A detailed error analysis for all popular circle fitting methods -- geometric fit, Kasa fit, Pratt fit, and Taubin fit -- is…