An efficient raster evaluation method for univariate polynomials
โ Scribed by W. Volk
- Publisher
- Springer Vienna
- Year
- 1988
- Tongue
- English
- Weight
- 460 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Cell decompositions are constructed for polynomials f (x) # Z p [x] of degree n, such that n< p, using O(n 2 ) cells. When f is square-free this yields a polynomialtime algorithm for counting and approximating roots in Z p . These results extend to give a polynomial-time algorithm in the bit model f
We discuss an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. With some assumptions, we show that the algorithm approximates the roots within about log ฯ/ ฯ(P ) iter
The combination of electroencephalography (EEG) and functional magnetic resonance imaging (fMRI) has been proposed as a tool to study brain dynamics with both high temporal and high spatial resolution. Multimodal imaging techniques rely on the assumption of a common neuronal source for the different