Related papers: How to Compute a Puiseux Expansion
For continuous boundary data, including data of polynomial growth, modified Poisson integrals are used to write solutions to the half space Dirichlet and Neumann problems in $\mathbb{R}^{n}$. Pointwise growth estimates for these integrals…
An equation containing a fractional power of an elliptic operator of second order is studied for Dirichlet boundary conditions. Finite difference approximations in space are employed. The proposed numerical algorithm is based on solving an…
In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…
We describe a method for the rapid numerical evaluation of the Bessel functions of the first and second kinds of nonnegative real orders and positive arguments. Our algorithm makes use of the well-known observation that although the Bessel…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
In this paper we discuss an approach to calculate knot polynomials on a photonic processor. Calculations of knot polynomials is a computationally difficult problem and therefore it is interesting to use new advanced calculation methods to…
We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…
We offer new Tauberian theorems for a generalized partition function as our main result. Our analysis provides insight into asymptotic behavior of power series with arithmetic functions as coefficients.
Given the Fourier-Legendre expansions of $f$ and $g$, and mild conditions on $f$ and $g$, we derive the Fourier-Legendre expansion of their product in terms of their corresponding Fourier-Legendre coefficients. In this way, expansions of…
The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…
For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…
This paper introduces an efficient sparse recovery approach for Polynomial Chaos (PC) expansions, which promotes the sparsity by breaking the dimensionality of the problem. The proposed algorithm incrementally explores sub-dimensional…
In this paper we present two algorithms for the multiplication of sparse Laurent polynomials and Poisson series (the latter being algebraic structures commonly arising in Celestial Mechanics from the application of perturbation theories).…
We present a computational toolkit for (local) Poisson-Nijenhuis calculus on manifolds. Our python module $\textsf{PoissonGeometry}$ implements our algorithms, and accompanies this paper. We include two examples of how our methods can be…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.
We present an algorithm for efficient computation of the constant term of a power of a multivariate Laurent polynomial. The algorithm is based on univariate interpolation, does not require the storage of intermediate data and can be easily…
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
An algorithm is given for explicitly computing Penrose diagrams for spacetimes of the form $ds^2 = -f(r)\, dt^2 + f(r)^{-1} \, dr^2 + r^2 \, d\Omega^2$. The resulting diagram coordinates are shown to extend the metric continuously and…
A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…