相关论文: Fast evaluation of some p-adic transcendental func…

We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…

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 consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…

Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…

A split hypercomplex learning algorithm for the training of nonlinear finite impulse response adaptive filters for the processing of hypercomplex signals of any dimension is proposed. The derivation strictly takes into account the laws of…

An algorithm to compute Dirichlet $L$-functions for many quadratic characters is derived. The algorithm is optimal (up to logarithmic factors) provided that the conductors of the characters under consideration span a dyadic window.

We prove a dynamical version of the Mordell-Lang conjecture for subvarieties of the affine space A^g over a p-adic field, endowed with polynomial actions on each coordinate of A^g. We use analytic methods similar to the ones employed by…

We introduce new p-adic convergent functions, which we call the p-adic hypergeometric functions of logarithmic type. The first main result is to prove the congruence relations that are similar to Dwork's. The second main result is that the…

We introduce a method for computing some pseudo-elliptic integrals in terms of elementary functions. The method is simple and fast in comparison to the algebraic case of the Risch-Trager-Bronstein algorithm. This method can quickly solve…

We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities over the reals, and computing affine spans and convex hulls. As…

In this paper, using the tools from the lineability theory, we distinguish certain subsets of $p$-adic differentiable functions. Specifically, we show that the following sets of functions are large enough to contain an infinite dimensional…

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ in time quasilinear in $X$.…

We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…

We construct $p$-adic multiple $L$-functions in several variables, which are generalizations of the classical Kubota-Leopoldt $p$-adic $L$-functions, by using a specific $p$-adic measure. Our construction is from the $p$-adic analytic side…

A method of constructing finite $p$-adic Sylvester expansions for all rationals is presented. This method parallels the classical Fibonacci-Sylvester (greedy) algorithm by iterating a $p$-adic division algorithm. The method extends to…

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…