新生學校財團法人新生醫護管理專科學校圖書館 |

Computational theory of iterative methods

紀錄類型:	書目-電子資源 : 單行本
正題名/作者:	Computational theory of iterative methods/ Ioannis K. Argyros.
作者:	Argyros, Ioannis K.
出版者:	Amsterdam ;Elsevier, : 2007.,
面頁冊數:	xv, 487 p. :ill. ; : 25 cm.;
叢書名:	Studies in computational mathematics ;
標題:	Iterative methods (Mathematics) -
電子資源:	An electronic book accessible through the World Wide Web; click for information
ISBN:	9780444531629

Computational theory of iterative methods
Argyros, Ioannis K.

Computational theory of iterative methods[electronic resource] /Ioannis K. Argyros. - Amsterdam ;Elsevier,2007. - xv, 487 p. :ill. ;25 cm. - Studies in computational mathematics ;15.

Includes bibliographical references and index.

1. Linear Spaces -- 2. Monotone convergence -- 3. Contractive Fixed Point Theory -- 4. Solving Smooth Equations -- 5. Newton-like methods -- 6. More Results on Newton's Method -- 7. Equations with Nonsmooth Operators -- 8. Applications of the weaker version of the Newton-Kantorovich theorem -- 9. The Newton-Kantorovich Theorem and Mathematical Programming -- 10. Generalized equations -- 11. Monotone convergence of point to set-mapping -- 12. Fixed points of point-to-set mappings -- 13. Special topics -- Bibliography -- A Glossary of Symbols -- Index.

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.

Electronic reproduction.
Amsterdam :
Elsevier Science & Technology,
2008.

Mode of access: World Wide Web.

ISBN: 9780444531629

Source: 140902:141044Elsevier Science & Technologyhttp://www.sciencedirect.comSubjects--Topical Terms:

197024
Iterative methods (Mathematics)
Index Terms--Genre/Form:

96803
Electronic books.

LC Class. No.: QA297.8 / .A74 2007eb

Dewey Class. No.: 518.26

Computational theory of iterative methods
LDR:03113cmm 2200349Ia 4500 001 153108
003 OCoLC
005 20100729101520.0
006 m d
007 cr cn|||||||||
008 160218s2007 ne a ob 001 0 eng d
020 $a 9780444531629
020 $a 0444531629
029 1 $a NZ1 $b 12541687
029 1 $a AU@ $b 000043178528
035 $a (OCoLC)228148108
035 $a ocn228148108
037 $a 140902:141044 $b Elsevier Science & Technology $n http://www.sciencedirect.com
040 $a OPELS $c OPELS
049 $a TEFA
050 1 4 $a QA297.8 $b .A74 2007eb
082 0 4 $a 518.26 $2 22
100 1 $a Argyros, Ioannis K. $3 291245
245 1 0 $a Computational theory of iterative methods $h [electronic resource] / $c Ioannis K. Argyros.
260 $a Amsterdam ; $a London : $c 2007. $b Elsevier,
300 $a xv, 487 p. : $b ill. ; $c 25 cm.
440 0 $a Studies in computational mathematics ; $v 15
504 $a Includes bibliographical references and index.
505 0 $a 1. Linear Spaces -- 2. Monotone convergence -- 3. Contractive Fixed Point Theory -- 4. Solving Smooth Equations -- 5. Newton-like methods -- 6. More Results on Newton's Method -- 7. Equations with Nonsmooth Operators -- 8. Applications of the weaker version of the Newton-Kantorovich theorem -- 9. The Newton-Kantorovich Theorem and Mathematical Programming -- 10. Generalized equations -- 11. Monotone convergence of point to set-mapping -- 12. Fixed points of point-to-set mappings -- 13. Special topics -- Bibliography -- A Glossary of Symbols -- Index.
520 $a 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.
533 $a Electronic reproduction. $b Amsterdam : $c Elsevier Science & Technology, $d 2008. $n Mode of access: World Wide Web. $n System requirements: Web browser. $n Title from title screen (viewed on May 14, 2008). $n Access may be restricted to users at subscribing institutions.
650 0 $a Iterative methods (Mathematics) $3 197024
655 7 $a Electronic books. $2 local. $3 96803
710 2 $a ScienceDirect (Online service) $3 254709
776 1 $c Original $z 9780444531629 $z 0444531629 $w (OCoLC)124959845
856 4 0 $3 ScienceDirect $u http://www.sciencedirect.com/science/publication?issn=1570579X&volume=15 $z An electronic book accessible through the World Wide Web; click for information
994 $a C0 $b TEF