My Account Log in

2 options

Iterative algorithms. I / [editors], Ioannis K. Argyros and Á. Alberto Magreñán.

EBSCOhost Academic eBook Collection (North America) Available online

View online

Ebook Central Academic Complete Available online

View online
Format:
Book
Contributor:
Argyros, Ioannis K., editor.
Magreñán, Á. Alberto, editor.
Series:
Mathematics research developments series.
Mathematics research developments
Language:
English
Subjects (All):
Iterative methods (Mathematics).
Algorithms.
Numerical analysis.
Physical Description:
1 online resource (445 pages) : color illustrations.
Place of Publication:
New York : Nova Publishers, [2017]
Summary:
It is a well-known fact that iterative methods have been studied concerning problems where mathematicians cannot find a solution in a closed form. There exist methods with different behaviors when they are applied to different functions and methods with higher order of convergence, methods with great zones of convergence, methods which do not require the evaluation of any derivative, and optimal methods among others. It should come as no surprise, therefore, that researchers are developing new iterative methods frequently. Once these iterative methods appear, several researchers study them in different terms: convergence conditions, real dynamics, complex dynamics, optimal order of convergence, etc. These phenomena motivated the authors to study the most used and classical ones, for example Newton's method, Halley's method and/or its derivative-free alternatives. Related to the convergence of iterative methods, the most well-known conditions are the ones created by Kantorovich, who developed a theory which has allowed many researchers to continue and experiment with these conditions. Many authors in recent years have studied modifications of these conditions related, for example, to centered conditions, omega-conditions and even convergence in Hilbert spaces. In this monograph, the authors present their complete work done in the past decade in analyzing convergence and dynamics of iterative methods. It is the natural outgrowth of their related publications in these areas. Chapters are self-contained and can be read independently. Moreover, an extensive list of references is given in each chapter in order to allow the reader to use the previous ideas. For these reasons, the authors think that several advanced courses can be taught using this book. The book's results are expected to help find applications in many areas of applied mathematics, engineering, computer science and real problems. As such, this monograph is suitable to researchers, graduate students and seminar instructors in the above subjects. The authors believe it would also make an excellent addition to all science and engineering libraries.
Notes:
Includes index.
Includes bibliographical references and index.
Description based on online resource; title from PDF title page (ebrary, viewed December 27, 2016).
ISBN:
1-63485-422-5

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account