Point Estimation of Root Finding Methods

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book sets out to state computationally verifiable initial conditions for predicting the immediate appearance of the guaranteed and fast convergence of iterative root finding methods. Attention is paid to iterative methods for simultaneous determination of polynomial zeros in the spirit of Smale's point estimation theory, introduced in 1986. Some basic concepts and Smale's theory for Newton's method, together with its modifications and higher-order methods, are presented in the first two chapters. The remaining chapters contain the recent author's results on initial conditions guaranteing convergence of a wide class of iterative methods for solving algebraic equations.

These conditions are of practical interest since they depend only on available data, the information of a function whose zeros are sought and initial approximations. The convergence approach presented can be applied in designing a package for the simultaneous approximation of polynomial zeros.

Author(s): Miodrag Petković (eds.)
Series: Lecture notes in mathematics 1933
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008

Language: English
Pages: 210
City: [New York]
Tags: Numerical Analysis

Front Matter....Pages i-xii
Basic Concepts....Pages 1-34
Iterative Processes and Point Estimation Theory....Pages 35-66
Point Estimation of Simultaneous Methods....Pages 67-127
Families of Simultaneous Methods of Higher Order: Part I....Pages 129-160
Families of Simultaneous Methods of Higher Order: Part II....Pages 161-195
Back Matter....Pages 197-210