✦ LIBER ✦

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

✍ Scribed by M. S. Petković

Publisher: Springer Vienna
Year: 1990
Tongue: English
Weight: 586 KB
Volume: 45
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02250583

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel wilf algorithm for complex ze

A parallel wilf algorithm for complex zeros of a polynomial

✍ E. V. Krishnamurthy; H. Venkateswaran 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 401 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 some iteration functions for the simu

On some iteration functions for the simultaneous computation of multiple complex polynomial zeros

✍ Miodrag S. Petković; Lidija V. Stefanović 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 482 KB

Iterative methods for multiple zeros of

Iterative methods for multiple zeros of a polynomial by clustering

✍ Tsuyako Miyakoda 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 700 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

On a generalisation of the root iteratio

On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic

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