Iterative methods for simultaneous inclusion of polynomial zeros / Miodrag Petkovic
Type de document : Livre numériqueCollection : Lecture notes in mathematics, 1387Langue : anglais.Éditeur : Berlin : Springer-Verlag, 1989ISBN: 9783540514855.ISSN: 1617-9692.Sujet MSC : 65H05, Numerical analysis - Nonlinear algebraic or transcendental equations, Numerical computation of solutions to single equations65G30, Numerical analysis - Error analysis and interval analysis, Interval and finite arithmetic
30C15, Functions of a complex variable - Geometric function theory, Zeros of polynomials, rational functions, and other analytic functions of one complex variableEn-ligne : Springerlink | Zentralblatt | MathSciNet
This book collects, reviews, unifies and augments many interesting developments in the solution of polynomial equations. Galois’ famous theorem concerning polynomial zeros states that a general direct method in terms of explicit formulas exist only for polynomials of degree less than five. Because of that, for finding zeros of higher degree polynomials one has to apply numerical methods. These methods, which generally take the form of an iterative process, give rise to the questions: How close is the current iterate to the solution, how fast does the iteration converge, can we trust the computed numbers? ... (Zentralblatt)
There are no comments on this title.