國立虎尾科技大學 |

Computational methods in nonlinear analysis = efficient algorithms, fixed point theory and applications /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Computational methods in nonlinear analysis/ Ioannis K. Argyros, Saïd Hilout.
Reminder of title:	efficient algorithms, fixed point theory and applications /
Author:	Argyros, Ioannis K.
other author:	Hilout, Saïd,
Published:	[Hackensack] New Jersey :World Scientific, : 2013.,
Description:	1 online resource (xv, 575 p.)
Subject:	Nonlinear theories - Data processing. -
Online resource:	http://www.worldscientific.com/worldscibooks/10.1142/8475#t=toc
ISBN:	9789814405836 (electronic bk.)

Computational methods in nonlinear analysis = efficient algorithms, fixed point theory and applications /
Argyros, Ioannis K.

Computational methods in nonlinear analysisefficient algorithms, fixed point theory and applications /[electronic resource] :Ioannis K. Argyros, Saïd Hilout. - [Hackensack] New Jersey :World Scientific,2013. - 1 online resource (xv, 575 p.)

Includes bibliographical references (pages 553-572) and index.

1. Newton's methods. 1.1. Convergence under Lipschitz conditions. 1.2. Convergence under generalized Lipschitz conditions. 1.3. Convergence without Lipschitz conditions. 1.4. Convex majorants. 1.5. Nondiscrete induction. 1.6. Exercises -- 2. Special conditions for Newton's method. 2.1. [symbol]-convergence. 2.2. Regular smoothness. 2.3. Smale's [symbol]-theory. 2.4. Exercises -- 3. Newton's method on special spaces. 3.1. Lie groups. 3.2. Hilbert space. 3.3. Convergence structure. 3.4. Riemannian manifolds. 3.5. Newton-type method on Riemannian manifolds. 3.6. Traub-type method on Riemannian manifolds. 3.7. Exercises -- 4. Secant method. 4.1. Semi-local convergence. 4.2. Secant-type method and nondiscrete induction. 4.3. Efficient Secant-type method. 4.4. Secant-like method and recurrent functions. 4.5. Directional Secant-type method. 4.6. A unified convergence analysis. 4.7. Exercises -- 5. Gauss-Newton method. 5.1. Regularized Gauss-Newton method. 5.2. Convex composite optimization. 5.3. Proximal Gauss-Newton method. 5.4. Inexact method and majorant conditions. 5.5. Exercises -- 6. Halley's method. 6.1. Semi-local convergence. 6.2. Local convergence. 6.3. Traub-type multipoint method. 6.4. Exercises -- 7. Chebyshev's method. 7.1. Directional methods. 7.2. Chebyshev-Secant methods. 7.3. Majorizing sequences for Chebyshev's method. 7.4. Exercises -- 8. Broyden's method. 8.1. Semi-local convergence. 8.2. Exercises -- 9. Newton-like methods. 9.1. Modified Newton method and multiple zeros. 9.2. Weak convergence conditions. 9.3. Local convergence for Newton-type method. 9.4. Two-step Newton-like method. 9.5. A unifying semi-local convergence. 9.6. High order Traub-type methods. 9.7. Relaxed Newton's method. 9.8. Exercises -- 10. Newton-Tikhonov method for ill-posed problems. 10.1. Newton-Tikhonov method in Hilbert space. 10.2. Two-step Newton-Tikhonov method in Hilbert space. 10.3. Regularization methods. 10.4. Exercises.

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.

ISBN: 9789814405836 (electronic bk.)Subjects--Topical Terms:

528214
Nonlinear theories
--Data processing.

LC Class. No.: QA427 / .A738 2013

Dewey Class. No.: 515/.355

Computational methods in nonlinear analysis = efficient algorithms, fixed point theory and applications /
LDR:04342cam a2200301Ii 4500 001 793827
003 OCoLC
005 20141031101135.0
006 m o d
007 cr mn|||||||||
008 150316s2013 nju ob 001 0 eng d
020 $a 9789814405836 (electronic bk.)
020 $a 9814405833 (electronic bk.)
020 $a 9789814405843 (electronic bk.)
020 $z 9789814405829 (hardcover : alk. paper)
020 $z 9814405825 (hardcover : alk. paper)
035 $a (OCoLC)855022917
035 $a ocn855022917
040 $a N $b eng $c N $d E7B $d CDX $d I9W $d OSU $d YDXCP
050 4 $a QA427 $b .A738 2013
082 0 4 $a 515/.355 $2 23
100 1 $a Argyros, Ioannis K. $3 681213
245 1 0 $a Computational methods in nonlinear analysis $h [electronic resource] : $b efficient algorithms, fixed point theory and applications / $c Ioannis K. Argyros, Saïd Hilout.
260 $a [Hackensack] New Jersey : $b World Scientific, $c 2013.
300 $a 1 online resource (xv, 575 p.)
504 $a Includes bibliographical references (pages 553-572) and index.
505 0 $a 1. Newton's methods. 1.1. Convergence under Lipschitz conditions. 1.2. Convergence under generalized Lipschitz conditions. 1.3. Convergence without Lipschitz conditions. 1.4. Convex majorants. 1.5. Nondiscrete induction. 1.6. Exercises -- 2. Special conditions for Newton's method. 2.1. [symbol]-convergence. 2.2. Regular smoothness. 2.3. Smale's [symbol]-theory. 2.4. Exercises -- 3. Newton's method on special spaces. 3.1. Lie groups. 3.2. Hilbert space. 3.3. Convergence structure. 3.4. Riemannian manifolds. 3.5. Newton-type method on Riemannian manifolds. 3.6. Traub-type method on Riemannian manifolds. 3.7. Exercises -- 4. Secant method. 4.1. Semi-local convergence. 4.2. Secant-type method and nondiscrete induction. 4.3. Efficient Secant-type method. 4.4. Secant-like method and recurrent functions. 4.5. Directional Secant-type method. 4.6. A unified convergence analysis. 4.7. Exercises -- 5. Gauss-Newton method. 5.1. Regularized Gauss-Newton method. 5.2. Convex composite optimization. 5.3. Proximal Gauss-Newton method. 5.4. Inexact method and majorant conditions. 5.5. Exercises -- 6. Halley's method. 6.1. Semi-local convergence. 6.2. Local convergence. 6.3. Traub-type multipoint method. 6.4. Exercises -- 7. Chebyshev's method. 7.1. Directional methods. 7.2. Chebyshev-Secant methods. 7.3. Majorizing sequences for Chebyshev's method. 7.4. Exercises -- 8. Broyden's method. 8.1. Semi-local convergence. 8.2. Exercises -- 9. Newton-like methods. 9.1. Modified Newton method and multiple zeros. 9.2. Weak convergence conditions. 9.3. Local convergence for Newton-type method. 9.4. Two-step Newton-like method. 9.5. A unifying semi-local convergence. 9.6. High order Traub-type methods. 9.7. Relaxed Newton's method. 9.8. Exercises -- 10. Newton-Tikhonov method for ill-posed problems. 10.1. Newton-Tikhonov method in Hilbert space. 10.2. Two-step Newton-Tikhonov method in Hilbert space. 10.3. Regularization methods. 10.4. Exercises.
520 $a 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.
588 $a Description based on print version record.
650 0 $a Nonlinear theories $x Data processing. $3 528214
650 0 $a Mathematics $x Data processing. $3 527942
700 1 $a Hilout, Saïd, $e author. $3 996746
856 4 0 $u http://www.worldscientific.com/worldscibooks/10.1142/8475#t=toc