✦ LIBER ✦

Polynomial iterations of rth order for the extraction of kth roots

✍ Scribed by Shlomo Breuer

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 461 KB
Volume: 25
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(89)90075-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The numerical stability of the generalis

The numerical stability of the generalised root iterations for polynomial zeros

✍ Miodrag S. Petković; Lidija V. Stefanović 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 564 KB

An Iterated Eigenvalue Algorithm for App

An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials

✍ Steven Fortune 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 655 KB

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

Lower bounds for the R-order of converge

Lower bounds for the R-order of convergence of simultaneous inclusion methods for polynomial roots and related iteration methods

✍ Lidiya Y. Atanassova; Jürgen P. Herzberger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 502 KB

On some improvements of square root iter

On some improvements of square root iteration for polynomial complex zeros

✍ M.S. Petković; L.V. Stefanović 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Bounds for the expectation of the kth ro

Bounds for the expectation of the kth root of a random variable

✍ K.O. Bowman; H.K. Lam; L.R. Shenton 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Bernstein's asymptotic best bound for th

Bernstein's asymptotic best bound for the Kth derivative of a polynomial

✍ Robert Whitley 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 462 KB