PERHAPS A GIFT VOUCHER FOR MUM?: MOTHER'S DAY

Close Notification

Your cart does not contain any items

Computational Methods In Nonlinear Analysis

Efficient Algorithms, Fixed Point Theory And Applications

Ioannis K Argyros (Cameron Univ, Usa) Said Hilout (Poitiers Univ, France)

$383.99

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
World Scientific Publishing Co Pte Ltd
17 July 2013
The field of computational sciences has seen a considerable development in mathematics, engineering sciences, and economic equilibrium theory. Researchers in this field are faced with the problem of solving a variety of equations or variational inequalities. We note that in computational sciences, the practice of numerical analysis for finding such solutions is essentially connected to variants of Newton's method. The efficient computational methods for finding the solutions of fixed point problems, nonlinear equations and variational inclusions are the first goal of the present book. The second goal is the applications of these methods in nonlinear problems and the connection with fixed point theory.

This book is intended for researchers in computational sciences, and as a reference book for an advanced computational methods in nonlinear analysis. We collect the recent results on the convergence analysis of numerical algorithms in both finite-dimensional and infinite-dimensional spaces, and present several applications and connections with fixed point theory. The book contains abundant and updated bibliography, and provides comparison between various investigations made in recent years in the field of computational nonlinear analysis.

By:   , ,
Imprint:   World Scientific Publishing Co Pte Ltd
Country of Publication:   Singapore
Dimensions:   Height: 249mm,  Width: 170mm,  Spine: 36mm
Weight:   1.134kg
ISBN:   9789814405829
ISBN 10:   9814405825
Pages:   592
Publication Date:  
Audience:   College/higher education ,  Further / Higher Education
Format:   Hardback
Publisher's Status:   Active
Kantorovich Theory for Newton-Like Methods; Holder Conditions and Newton-Type Methods; Regular Smoothness Conditions for Iterative Methods; Fixed Point Theory and Iterative Methods; Mathematical Programming; Fixed Point Theory for Set-Valued Mapping; Special Convergence Conditions; Recurrent Functions and Newton-Like Methods; Recurrent Functions and Special Iterative Methods.

See Also