相关论文: A package on orthogonal polynomials and special fu…
Formal Laurent-Puiseux series are important in many branches of mathematics. This paper presents a {\it Mathematica} implementation of algorithms developed by the author for converting between certain classes of functions and their…
This report (written in French) is devoted to studying special functions the most used in physics. Special functions are a very broad branch of mathematics, theoretical physics, and mathematical physics. They appeared in the nineteenth…
In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
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…
We describe the qFunctions Mathematica package for $q$-series and partition theory applications. This package includes both experimental and symbolic tools. The experimental set of elements includes guessers for $q$-shift equations and…
We present the Mathematica package $\texttt{MultiHypExp}$ that allows for the expansion of multivariate hypergeometric functions (MHFs), especially those likely to appear as solutions of multi-loop, multi-scale Feynman integrals, in the…
In the 6th Int. Symposium on OPSFA there were several communications dealing with concrete applications of orthogonal polynomials to experimental and theoretical physics, chemistry, biology and statistics. Here I make suggestions concerning…
This article describes the implementation in the software package NumGfun of classical algorithms that operate on solutions of linear differential equations or recurrence relations with polynomial coefficients, including what seems to be…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
The software package developed in the MS thesis research implements functions for the intelligent guessing of polynomial sequence formulas based on user-defined expected sequence factors of the input coefficients. We present a specialized…
In this paper, we present HyperPrecision, a Mathematica package for high-precision numerical evaluation of general Horn-type multivariate hypergeometric functions and their Laurent expansions in a small parameter $\epsilon$. Such functions…
We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…
We present the Olsson$.$wl Mathematica package which aims to find linear transformations for some classes of multivariable hypergeometric functions. It is based on a well-known method developed by P. O. M. Olsson in J. Math. Phys. 5, 420…
To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…
Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing…
The library \emph{fast\_polynomial} for Sage compiles multivariate polynomials for subsequent fast evaluation. Several evaluation schemes are handled, such as H\"orner, divide and conquer and new ones can be added easily. Notably, a new…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
We provide algorithms computing power series solutions of a large class of differential or $q$-differential equations or systems. Their number of arithmetic operations grows linearly with the precision, up to logarithmic terms.
Despite their promise and ubiquity, Gaussian processes (GPs) can be difficult to use in practice due to the computational impediments of fitting and sampling from them. Here we discuss a short R package for efficient multivariate normal…