LEADER 00000cam a2200601Ii 4500
001 ocn855022917
003 OCoLC
005 20160527041238.2
006 m o d
007 cr mn|||||||||
008 130805t20132013nju ob 001 0 eng d
020 9789814405836|q(electronic book)
020 9814405833|q(electronic book)
020 |z9789814405829|q(hardcover ;|qalkaline paper)
020 |z9814405825|q(hardcover ;|qalkaline paper)
035 (OCoLC)855022917
040 N$T|beng|erda|epn|cN$T|dE7B|dCDX|dI9W|dOSU|dYDXCP|dGGVRL
|dDEBSZ|dOCLCQ|dOCLCF
049 RIDW
050 4 QA427|b.A738 2013eb
072 7 MAT|x007000|2bisacsh
082 04 515/.355|223
090 QA427|b.A738 2013eb
100 1 Argyros, Ioannis K.,|0https://id.loc.gov/authorities/names
/n93015514|eauthor.
245 10 Computational methods in nonlinear analysis :|befficient
algorithms, fixed point theory and applications /|cIoannis
K. Argyros (Cameron University, USA), Saïd Hilout
(Poitiers University, France).
264 1 [Hackensack] New Jersey :|bWorld Scientific,|c[2013]
264 4 |c©2013
300 1 online resource (xv, 575 pages)
336 text|btxt|2rdacontent
337 computer|bc|2rdamedia
338 online resource|bcr|2rdacarrier
340 |gpolychrome|2rdacc
347 text file|2rdaft
504 Includes bibliographical references (pages 553-572) and
index.
505 0 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 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 0 Print version record.
590 eBooks on EBSCOhost|bEBSCO eBook Subscription Academic
Collection - North America
650 0 Nonlinear theories|0https://id.loc.gov/authorities/
subjects/sh85092332|xData processing.|0https://id.loc.gov/
authorities/subjects/sh99005487
650 0 Mathematics|xData processing.|0https://id.loc.gov/
authorities/subjects/sh85082146
650 7 Nonlinear theories|xData processing.|2fast|0https://
id.worldcat.org/fast/1038814
650 7 Nonlinear theories.|2fast|0https://id.worldcat.org/fast/
1038812
650 7 Mathematics|xData processing.|2fast|0https://
id.worldcat.org/fast/1012179
655 0 Electronic books.
655 4 Electronic books.
700 1 Hilout, Saïd,|0https://id.loc.gov/authorities/names/
n2010051455|eauthor.
776 08 |iPrint version:|aArgyros, Ioannis K.|tComputational
methods in nonlinear analysis.|dNew Jersey : World
Scientific, [2013]|z9789814405829|w(DLC) 2013005325
|w(OCoLC)792884975
856 40 |uhttps://rider.idm.oclc.org/login?url=http://
search.ebscohost.com/login.aspx?direct=true&scope=site&
db=nlebk&AN=622027|zOnline eBook. Access restricted to
current Rider University students, faculty, and staff.
856 42 |3Instructions for reading/downloading this eBook|uhttp://
guides.rider.edu/ebooks/ebsco
901 MARCIVE 20231220
948 |d20160607|cEBSCO|tebscoebooksacademic|lridw
994 92|bRID
