Computational Theory of Iterative Methods

By: Ioannis Argyros

Write A Review

eText | 4 September 2007

At a Glance

ePUB
504 Pages

eText

$236.50

or 4 interest-free payments of $59.13 with

Instant online reading in your Booktopia eTextbook Library *

Read online on

Desktop

Tablet

Mobile

Not downloadable to your eReader or an app

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

The book is designed for researchers, students and practitioners interested in using fast and efficient iterative methods to approximate solutions of nonlinear equations. The following four major problems are addressed. Problem 1: Show that the iterates are well defined. Problem 2: concerns the convergence of the sequences generated by a process and the question of whether the limit points are, in fact solutions of the equation. Problem 3: concerns the economy of the entire operations. Problem 4: concerns with how to best choose a method, algorithm or software program to solve a specific type of problem and its description of when a given algorithm succeeds or fails. The book contains applications in several areas of applied sciences including mathematical programming and mathematical economics. There is also a huge number of exercises complementing the theory.

- Latest convergence results for the iterative methods
- Iterative methods with the least computational cost
- Iterative methods with the weakest convergence conditions
- Open problems on iterative methods