Predicting Zero Coefficients in Formal Power Series Computations
β Scribed by K. Kalorkoti
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 261 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider the problem of predicting long sequences of zero coefficients in a power series obtained by multiplication, division or reversion (where all coefficients are integers). We describe efficient randomized algorithms whose probability of error can be controlled by the user. A runtime analysis is given and some experimental results are also presented that compare our algorithms with classical ones for formal power series computations. We envisage the algorithms given here as being of greatest use in situations where several processors are available so that the possibility of a long sequence of zeros can be tested in parallel to the normal computation of coefficients.
π SIMILAR VOLUMES
Let R be a commutative ring with 1, and let R = t + t 2 RΝ tΝ‘ be the group of normalized formal power series over R under substitution. In this paper we investigate the connection between the ideal structure of R and the normal subgroup structure of R . In particular, we show that, if K is a finite f
## By use of power flow techniques an assessment is made of the effect of damping on the vibrational energy of concrete plates which form a T-junction. The vibrational energies are predicted from knowledge of the loss factors, coupling loss factors, and radiation loss factors which were assessed t
## Abstract A power series solution for convergent radial transport in a single fracture (PCRTSF) is developed. Transport processes considered in PCRTSF include advection and hydrodynamic dispersion in the fracture, molecular diffusion in the matrix, diffusive mass exchange across the fractureβmatr