相关论文: A package on orthogonal polynomials and special fu…
We present an implementation of algorithms for the symbolic integration of hyperlogarithms multiplied by rational functions in the computer algebra system FORM. This implementation encompasses cases where hyperlogarithms have rational…
A unifying scheme of classical special functions of hypergeometric type obeying orthogonality or biorthogonality relations is described. It expands the Askey scheme of classical orthogonal polynomials and its $q$-analogue based on the…
It is demonstrated that the well-regularized hypergeometric functions can be evaluated directly and numerically. The package NumExp is presented for expanding hypergeometric functions and/or other transcendental functions in a small…
I present here PowerSpectR, an R package for computing and visualizing median-based radial Fourier power spectra from imaging data. Power spectra provide a representation of spatial structure by decomposing contributions across spatial…
We introduce FunKit, a Mathematica package for the derivation and tracing of functional equations from arbitrary master equations. FunKit provides an expression vocabulary and a set of rules that allow for derivations in any given field…
In this work, we give the power series solutions around an ordinary point, in the case of variable coefficients, homogeneous sequential linear conformable fractional differential equations of order 2\alpha. Further, we introduce the…
HYPERDIRE is a project devoted to the creation of a set of Mathematica-based programs for the differential reduction of hypergeometric functions. The current version allows for manipulations involving the full set of Horn-type…
This article gives a brief introduction to $q$-special functions, i.e., $q$-analogues of the classical special functions. Here $q$ is a deformation parameter, usually $0<q<1$, where $q=1$ is the classical case. The main topics to be treated…
The development of functions of real variables in Taylor and Frobenius series (whole series which are formed in nonorthogonal, nonperiodic bases), in sinusoidal Fourier series (bases of orthogonal, periodic functions), in series of special…
We present in this paper a detailed note on the computation of Puiseux series solutions of the Riccatti equation associated with a homogeneous linear ordinary differential equation. This paper is a continuation of [1] which was on the…
A correspondence between arbitrary Fourier series and certain analytic functions on the unit disk of the complex plane is established. The expression of the Fourier coefficients is derived from the structure of complex analysis. The…
We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…
Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…
For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…
We present the Mathematica package DREAM for arbitrarily high precision computation of multiloop integrals within the DRA (Dimensional Recurrence & Analyticity) method as solutions of dimensional recurrence relations. Starting from these…
Given the importance of floating-point~(FP) performance in numerous domains, several new variants of FP and its alternatives have been proposed (e.g., Bfloat16, TensorFloat32, and Posits). These representations do not have correctly rounded…
In this paper, we are interested in matrix valued orthogonal polynomials on the real line with respect to exponential weights. We obtain strong asymptotics as the degree tends to infinity in different regions of the complex plane, as well…
We develop the Akhiezer iteration, a generalization of the classical Chebyshev iteration, for the inner product-free, iterative solution of indefinite linear systems using orthogonal polynomials for measures supported on multiple, disjoint…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…