✦ LIBER ✦

A parallel wilf algorithm for complex zeros of a polynomial

✍ Scribed by E. V. Krishnamurthy; H. Venkateswaran

Publisher: Springer Netherlands
Year: 1981
Tongue: English
Weight: 401 KB
Volume: 21
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01934075

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A globally convergent parallel algorithm

A globally convergent parallel algorithm for zeros of polynomial systems

✍ Alexander P. Morgan; Layne T. Watson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 952 KB

An algorithm for locating all zeros of a

An algorithm for locating all zeros of a real polynomial

✍ F. Locher; M. -R. Skrzipek 📂 Article 📅 1995 🏛 Springer Vienna 🌐 English ⚖ 808 KB

On the complexity of a PL homotopy algor

On the complexity of a PL homotopy algorithm for zeros of polynomials

✍ Tang'an Gao; Zeke Wang 📂 Article 📅 1993 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 382 KB

On polynomial complexity of a stochastic

On polynomial complexity of a stochastic algorithm for mixed zero-one programs

✍ Raj Jagannathan 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 236 KB

A stochastic (randomization) algorithm for solving mixed zero-one programs in a yes-no form is presented. Under a set of conditions, we show that any mixed zero-one program is such that either a feasible solution for the problem is obtained or it is classiÿed as infeasible. The algorithm is such tha

Schröder-like algorithms for multiple co

Schröder-like algorithms for multiple complex zeros of a polynomial

✍ M. S. Petković 📂 Article 📅 1990 🏛 Springer Vienna 🌐 English ⚖ 586 KB

Note on approximating complex zeros of a

Note on approximating complex zeros of a polynomial

✍ Bernard Friedman 📂 Article 📅 1949 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB