This is a preview of subscription content, log in via an institution to check access.
References
N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
S. Smale, “Algorithms for solving equations,” Proc. Intern. Congr. Mathem., Berkeley (1986), pp. 13–14.
M. A. Krasnosel'skii and T. P. Zabreiko, Geometrical Methods of Nonlinear Analysis [in Russian], Nauka, Moscow (1975).
J.-C. Yakoubsohn, “Approximating the zeros of analytic functions by the exclusion algorithm,” Seminaire d'analyse numerique, Univ. Paul Sabatier, 1992–1993, part IV (1994).
J. Renegart, “On the worst-case arithmetic complexity of approximating zeros of polynomials,”J. Complexity, No., 3, 90–113 (1987).
P. Henrici, Applied and Computational Complex Analysis, Wiley, New York (1974).
P. Henrici and I. Gargantini, “Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial,” in: Constructive Aspects of the Fundamental Theorem of Algebra, Wiley, New York (1969), pp. 37–45.
S. Small, “Newton's method estimates from data at one point,” in: The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, Springer, New York (1985), pp. 10–27.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 67–75, September–October, 1994.
Rights and permissions
About this article
Cite this article
Shor, N.Z., Berezovskii, O.A. Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain. Cybern Syst Anal 30, 686–692 (1994). https://doi.org/10.1007/BF02367749
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02367749