Abstract
This paper presents two convergence theorems for SOR-like methods for solving nonlinear equations inR n orC n. The results are then applied to several methods for finding all the zeros of a polynomial simultaneously.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Alefeld and J. Herzberger, On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots. SIAM J. Numer., Anal.,11 (1974), 237–243.
L. Atanassova, On theR-order of a single-step Nourein type method. Computer Arithmetic and Enclosure Methods (eds. L. Atanassova and J. Herzberger), Elsevier Science Publishers B.V. (North-Holland), Amsterdam, 1992, 179–187.
W. Börsch-Supan, A posteriori error bounds for the zeros of polynomials. Numer. Math.,5 (1963), 380–398.
W. Börsch-Supan, Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation. Numer. Math.,14 (1970), 287–296.
L.W. Ehrlich, A modified Newton method for polynomials. Comm. ACM,10 (1967), 107–108.
M.R. Farmer and G. Loizou, A class of iterative functions for improving, simultaneously, approximations to the zeros of a polynomial. BIT,15 (1975), 250–258.
J. Herzberger, On theR-order of convergence of a class of simultaneous methods of approximating the roots of a polynomial. Numerical Methods and Error Bounds (Proc. IMACS-GAMM International Symposium on Numerical Methods and Error Bounds held in Oldenburg, July 9–12, 1995) (eds., G. Alefeld and J. Herzberger), Akademie Verlag, Berlin, 1996, 113–119.
S. Kanno, N.V. Kjurkchiev and T. Yamamoto, On some methods for the simultaneous determination of polynomial zeros. Japan J. Indust. Appl. Math.,13 (1996), 267–288.
S. Kanno, W. Liu and T. Yamamoto, On the Durand-Kerner method and its acceleration (Japanese). Lecture Notes915, Res. Inst. Math. Sci., Kyoto University, 1995, 225–249.
N. Kjurkchiev and A. Andreev, On the generalization of the Alefeld-Herzberger’s method. Computing,47 (1992), 355–360.
A.W. Nourein, An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial. Internat. J. Comp. Math.,3 (1977), 241–252.
M.S. Petkovic and G.M. Milovanovic, A note on some improvements of the simultaneous methods for determination of polynomial zeros. J. Comput. Appl. Math.,9 (1988), 65–69.
X. Wang and S. Zheng, A family of parallel and interval iterations for finding all roots of a polynomial simultaneously with rapid convergence. J. Comp. Math.,2 (1984), 70–76.
W. Werner, On the simultaneous determination of polynomial roots. Springer Lecture Notes,953, 1982, 188–202.
T. Yamamoto, S. Kanno and L. Atanassova, Validated computation of polynomial zeros by the Durand-Kerner method. Topics in Validated Computation (ed. J. Herzberger), North-Holland, Amsterdam, 1994, 27–53.
D.M. Young, Iterative Solution of Large Linear Systems. Academic Press, New York and London, 1971.
Author information
Authors and Affiliations
Additional information
This work was partially supported by the Scientific Research Grant-in-Aid from the Ministry of Education, Science, Sports and Culture of Japan.
About this article
Cite this article
Yamamoto, T. On nonlinear SOR-like methods, I — Applications to simultaneous methods for polynomial zeros. Japan J. Indust. Appl. Math. 14, 87–97 (1997). https://doi.org/10.1007/BF03167312
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF03167312