Iterative processes, functional equations and the Newton method

iterative processes method of nondiscrete induction Newton's method optimal convergence order of convergence rate of convergence sharp error estimates system of functional inequalities

Mathematics Subject Classification ID

Systems of functional equations and inequalities (39B72) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Review text

In this carefully written expository paper the author illustrates the idea of his method of nondiscrete induction [Linear Algebra Appl. 13, 223-238 (1976; Zbl 0323.46005)] for measuring convergence of iterative processes by applying it to Newton's method. The method of nondiscrete induction replaces the order of convergence (which is a number) with a new definition of the rate of convergence. It is now defined as a function which is the solution of a system of functional inequalities. These inequalities depend on the process and on the initial data. This rate of convergence is then used to obtain sharp error estimates and optimal convergence criteria. As described in the book by \textit{F.-A. Potra} and the author [Nondiscrete induction and iterative processes (1984; Zbl 0549.41001)], the method has been successfully applied to other iterative processes in numerical analysis. The rate of convergence of Newton's method was first established by the author [Numer. Math. 25, 279-285 (1976; Zbl 0304.65037)].

Recommendations

Cited in

(9)

This page was built for publication: Iterative processes, functional equations and the Newton method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121643)