A new summation method for power series with rational coefficients

We show that an asymptotic summation method, recently proposed by the authors, can be conveniently applied to slowly convergent power series whose coefficients are rational functions of the summation index. Several numerical examples are presented.

     

两类幂级数求和函数的一般方法

本文探讨了高等数学教材中的两类幂级数求和问题,并给出这两类幂级数求和函数的一般方法,同时进行了实例分析.     

一个高精度收敛的变系数微分方程精确解析法*

文[1]给出精确解析法,可用于求解任意变系数微分方程,所得到的解具有二阶收敛精度.在此基础上,本文以变截面梁弯曲为例,给出一个高精度的算法.不增加工作量的情况下可达到四阶收敛精度.具有计算快,简单等特点,文末给出算例,仅用很少的单元即可获得高的收敛精度,表明了本文理论的正确性.     

代数系数幂级数在超越数上值的代数无关性

本文证明了一类具有代数系数的幂级数在超越数上值约代数无关性．     

幂级数在收敛区间端点收敛时的性质

讨论幂级数及其逐项积分、逐项求导后的级数在收敛区间端点收敛时的若干性质,给出它们之间敛散性的关系,并把连续性和逐项可积性推广到幂级数的收敛域上.     

两类关于二项式系数倒数的级数(英文)

By applying the theory of formal power series,the author obtains the closed forms for two kinds of infinite series involving the reciprocals of binomial coefficients,and the author gets another closed form for the infinite series Σr≥m tn＋r/（n＋rr）.     

Uniform Convergence of Trigonometric Series with Rarely Changing Coefficients

We consider the series and whose coefficients satisfy the condition for , where the sequence can be expressed as the union of a finite number of lacunary sequences. The following results are obtained. If as , then the series is uniformly convergent. If for all , then the sequence of partial sums of this series is uniformly bounded. If the series is convergent for and as , then this series is uniformly convergent. If the sequence of partial sums of the series for is bounded and for all , then the sequence of partial sums of this series is uniformly bounded. In these assertions, conditions on the rates of decrease of the coefficients of the series are also necessary if the sequence is lacunary. In the general case, they are not necessary.     

关于多元幂级数

引入了多元函数项级数的概念,给出了其收敛域及和函数的定义;通过详实的例子讨论了多元幂级数的收敛域、和函数及多元函数展开为多元幂级数的计算方法.     

Estimates for Sums of Coefficients of Dirichlet Series with Functional Equation

Suppose we have a Dirichlet series L(s) = _{n = 1} a _n n ^–s such that it, and its twists by Dirichlet characters have analytic continuation and a functional equation of a specific kind. Suppose also that the root numbers of the twists are equidistributed on the unit circle. The purpose of this note is to get an estimate for the quantity for a prime modulus p.We use a modification of the method of Chandrasekharan and Narasimhan and we use in an essential way a Rankin-Selberg type estimate for the average of |a _n|².     

Transcendence of Binomial and Lucas' Formal Power Series

The formal power series[formula]is transcendental over (X) whentis an integer ≥ 2. This is due to Stanley forteven, and independently to Flajolet and to Woodcock and Sharif for the general case. While Stanley and Flajolet used analytic methods and studied the asymptotics of the coefficients of this series, Woodcock and Sharif gave a purely algebraic proof. Their basic idea is to reduce this series modulo prime numbersp, and to use thep-Lucas property: ifn = ∑n_ipⁱis the basepexpansion of the integern, then[equation]The series reduced modulopis then proved algebraic over _p(X), the field of rational functions over the Galois field _p, but its degree is not a bounded function ofp. We generalize this method to characterize all formal power series that have thep-Lucas property for “many” prime numbersp, and that are furthermore algebraic over (X).     

求函数项级数收敛区间的一种新方法

对形如∑∞n=0anxkn+b(k∈,b∈)的幂级数,当其缺项的时候,不能直接用公式ρ=li mn→∞an+1an求其收敛半径与收敛区间(本文约定收敛区间不含端点),一般都是直接采用达朗贝尔(比值)判别法求其收敛半径与收敛区间.事实上,对这种幂级数只需先作一个变量代换,就可以采用公式法求解.本文给出了这种方法的理论证明,并将结论进行了推广,即利用变量代换与公式法同样可求形如∑∞anxkn+bs(k,s∈,b∈)形式的函数项级数的收敛区间.     

On Influence of the Arguments of Coefficients of a Power Series Expansion of an Entire Function on the Growth of the Maximum of Its Modulus

Siberian Mathematical Journal - The following question is discussed: How fast can the maximum of the modulus of one entire function grow in comparison with the maximum of the modulus of another...     

The Method of Lyapunov Functionals for Neutral Type Linear Difference-Differential Systems with Almost Periodic Coefficients

A version of the direct Lyapunov method is suggested for the systems under study with the condition weakened on the derivative of the functional along the trajectories of the system as compared with the familiar results for equations with arbitrary continuous coefficients.     

The Fourier-series method for inverting transforms of probability distributions

This paper reviews the Fourier-series method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourier-series method are remarkably easy to use, requiring programs of less than fifty lines. The Fourier-series method can be interpreted as numerically integrating a standard inversion integral by means of the trapezoidal rule. The same formula is obtained by using the Fourier series of an associated periodic function constructed by aliasing; this explains the name of the method. This Fourier analysis applies to the inversion problem because the Fourier coefficients are just values of the transform. The mathematical centerpiece of the Fourier-series method is the Poisson summation formula, which identifies the discretization error associated with the trapezoidal rule and thus helps bound it. The greatest difficulty is approximately calculating the infinite series obtained from the inversion integral. Within this framework, lattice cdf's can be calculated from generating functions by finite sums without truncation. For other cdf's, an appropriate truncation of the infinite series can be determined from the transform based on estimates or bounds. For Laplace transforms, the numerical integration can be made to produce a nearly alternating series, so that the convergence can be accelerated by techniques such as Euler summation. Alternatively, the cdf can be perturbed slightly by convolution smoothing or windowing to produce a truncation error bound independent of the original cdf. Although error bounds can be determined, an effective approach is to use two different methods without elaborate error analysis. For this purpose, we also describe two methods for inverting Laplace transforms based on the Post-Widder inversion formula. The overall procedure is illustrated by several queueing examples.