Sciweavers

352 search results - page 1 / 71
» On the convergence of the power series algorithm
Sort
View
PE
2000
Springer
101views Optimization» more  PE 2000»
13 years 4 months ago
On the convergence of the power series algorithm
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
Gerard Hooghiemstra, Ger Koole
ANTS
1998
Springer
135views Algorithms» more  ANTS 1998»
13 years 9 months ago
Fast Multiprecision Evaluation of Series of Rational Numbers
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
Bruno Haible, Thomas Papanikolaou
TNN
1998
94views more  TNN 1998»
13 years 4 months ago
Global convergence of Oja's subspace algorithm for principal component extraction
—Oja’s principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the conve...
Tianping Chen, Yingbo Hua, Wei-Yong Yan
MOC
2000
94views more  MOC 2000»
13 years 4 months ago
A new summation method for power series with rational coefficients
Abstract. We show that an asymptotic summation method, recently proposed by the authors, can be conveniently applied to slowly convergent power series whose coefficients are ration...
Silvia Dassié, Marco Vianello, Renato Zanov...
AMC
2005
125views more  AMC 2005»
13 years 4 months ago
A new symbolic computation for formal integration with exact power series
This paper describes a new symbolic algorithm for formal integration of a class of functions in the context of exact power series by using generalized hypergeometric series and co...
Onur Kiymaz, Seref Mirasyedioglu