相关论文: Computing the Action of the Generating Function of…

Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…

This paper reviews the most popular methods which are used in lattice QCD to compute the determinant of the lattice Dirac operator: Gaussian integral representation and noisy methods. Both of them lead naturally to matrix function problems.…

Charlier configurations provide a combinatorial model for Charlier polynomials. We use this model to give a combinatorial proof of a multilinear generating function for Charlier polynomials. As special cases of the multilinear generating…

Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Two methods of constructing 2D Toda $\tau$-functions that are generating functions for certain geometrical invariants of a combinatorial nature are related. The first involves generation of paths in the Cayley graph of the symmetric group…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

In this paper we describe an algorithm and a Fortran 90 module ({\bf Conical}) for the computation of the conical function $P^m_{-\tfrac12+i\tau}(x)$ for $x>-1$, $m \ge 0$, $\tau >0$. These functions appear in the solution of Dirichlet…

Matrix functions with potential applications have a major role in science and engineering. One of the fundamental matrix functions, which is particularly important due to its connections with certain matrix differential equations and other…

Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed.…

We give continued fraction expansions of the generating functions of Bernoulli numbers, Cauchy numbers, Euler numbers, harmonic numbers, and their generalized or related numbers. In particular, we focus on explicit forms of the convergents…

An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to…

We extend to Barvinok's valuations the Euler-Maclaurin expansion formula which we obtained previously for the sum of values of a polynomial over the integral points of a rational polytope. This leads to an improvement of Barvinok's…

A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…

In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…

We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…

We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…

Let Y be a random variable whose moment generating function exists in a neighborhood of the origin. The aim of this paper is to represent arbitrary polynomials in terms of probabilistic Frobenius-Euler polynomials associated with Y and…

We establish recurrences formulas of the order of the classical groups that allow us to find a generalization of Euler's angles for classical groups and the invariant measures of these groups. We find the generating function for the SU(2)…

The main purpose of this paper is to present a systemic study of some families of multiple $q$-Euler numbers and polynomials. In particular, by using the $q$-Volkenborn integration on $\Bbb Z_p$, we construct $p$-adic $q$-Euler numbers and…