A note on the convergence of the Weierstrass sor method for polynomial roots
✍ Scribed by M.S. Petković; N. Kjurkchiev
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 428 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
Convergence properties of the SOR Weierstrass method for the simultaneous approximation of polynomial roots are considered. The choice of acceleration parameter is discussed.
📜 SIMILAR VOLUMES
It is well known that successive overrelaxation (SOR) can be used to compute the stationary distribution of a homogeneous Markov chain. In a long paper Kontovasalis et al. (K. Kontovasalis, R.J. Plemmons, W.J. Stewart, Linear Algebra Appl. 154-156 (1991) showed together with other results that for p
Many problems in mathematics and other natural sciences and techniques reduce themselves to determining all roots of generalized polynomial equations. We consider in this paper the situations in which the critical initial approximations {z:}, i = 1,. ,n, fail, when the iterative methods of Newton-We
## By using the technique proposed in ), Trans. Amer. Math. Soc. 349, 2427 -2441] , we derive an exact formula for the mean number of complex roots of a complex random polynomial. The explicit evaluation of the average density is obtained in the case of multivariate normal coe cients and its co