相关论文: An algorithm for determining the radii of converge…

The purpose of this paper is to introduce the branching geometry of algebraic functions around singular points and to describe a simple method of determining radii of convergence of their power expansions in terms of those singular points.…

An efficient method of computing power expansions of algebraic functions is the method of Kung and Traub and is based on exact arithmetic. This paper shows a numeric approach is both feasible and accurate while also introducing a…

This paper describes an algorithm for determining the branching geometry of algebraic functions. The graphs of these complex-valued functions have a complicated interweaving structure that can be described by analytic branches separated by…

In this paper for power series in many (real or complex)variables a radius of (absolute) convergence is offered. This radius can be evaluated by a formula similar to Cauchy-Hadamard formula and in one variable case they are same.

An effective radius of convergence is defined and computed for any truncated Taylor series. Applications to well known series are performed and is shown that a range of good coincidence for actual and approximative plot can always be found.…

We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…

We define ''convergence'' for noncommutative power series and construct two topologies on the algebra of power series, convergent with respect to a positive radius. We indicate all finite dimensional continuous representations of this…

Contour integration is a crucial technique in many numeric methods of interest in physics ranging from differentiation to evaluating functions of matrices. It is often important to determine whether a given contour contains any poles or…

We study the existence of formal power series solutions to q-algebraic equations. When a solution exists, we give a sufficient condition on the equation for this solution to have a positive radius of convergence. We emphasize on the case…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

It is well known that algebraic power series are differentially finite (D-finite): they satisfy linear differential equations with polynomial coefficients. The converse problem, whether a given D-finite power series is algebraic or…

This paper is mainly concerned with the disk of convergence of a power series s(x) representing an algebraic function of x and specifically with the relation between this disk and the branch points of the function. We shall focus especially…

This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…

It is described how the Hermite-Pad\'e polynomials corresponding to an algebraic approximant for a power series may be used to predict coefficients of the power series that have not been used to compute the Hermite-Pad\'e polynomials. A…

Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…

Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study the real solutions to systems of polynomial equations and polynomial inequalities. As it is the real solutions to such systems modeling…

We discuss algorithms for arithmetic properties of hypergeometric functions. Most notably, we are able to compute the p-adic valuation of a hypergeometric function on any disk of radius smaller than the p-adic radius of convergence. This we…

Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…