✦ LIBER ✦

On a family of parallel root-finding methods for generalized polynomials

✍ Scribed by Zhengda Huang; Shiming Zheng

Book ID: 108396053
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 362 KB
Volume: 91
Category: Article
ISSN: 0096-3003
DOI: 10.1016/s0096-3003(97)10022-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some parallel methods for polynomial roo

Some parallel methods for polynomial root-finding

✍ A.J. Maeder; S.A. Wynton 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Parallel algorithms for finding polynomi

Parallel algorithms for finding polynomial Roots on

✍ Keny T. Lucas; Prasanta K. Jana 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 1016 KB

A family of root finding methods

✍ Eldon Hansen; Merrell Patrick 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 561 KB

A parallel algorithm for finding roots o

A parallel algorithm for finding roots of a complex polynomial

✍ Jinsong Cheng 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 503 KB

A general method to generate parallel it

A general method to generate parallel iterations for finding all zeros of polynomial simultaneously

✍ Danfu Han; Xinghua Wang 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 217 KB

Method for finding multiple roots of pol

Method for finding multiple roots of polynomials

✍ Chang-Dau Yan; Wei-Hua Chieng 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 851 KB

Conventional numerical methods for finding multiple roots of polynomials are inaccurate. The accuracy is unsatisfactory because the derivatives of the polynomial in the intermediate steps of the associated root-finding procedures are eliminated. Engineering applications require that this problem be