𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Investigation of a subdivision based algorithm for solving systems of polynomial equations

✍ Scribed by Jürgen Garloff; A.P. Smith

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
381 KB
Volume
47
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Iteration algorithms for solving a syste
Iteration algorithms for solving a system of fuzzy linear equations
✍ Xizhao Wang; Zimian Zhong; Minghu Ha 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

In this paper, we discuss the solution of a system of fuzzy linear equations, X = AX + U , and its iteration algorithms where A is a real n × n matrix, the unknown vector X and the constant U are all vectors consisting of n fuzzy numbers, and the addition, scale-multiplication are deÿned by Zadeh's

Improving a method of search for solving
Improving a method of search for solving polynomial equations
✍ M. Hujter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 136 KB

This paper is related to the Lehmer-Schur methods in numerical mathematics in the complex plane. It is shown that by a slight modification of the "optimized" Lehmer-Schur method of Gal~ntai, the "speed" quotient 0.6094 can be reduced to 0.5758. The crucial idea is based on a discrete geometrical obs