LEADER 03563nam 22006852 450 001 9910449676303321 005 20151005020621.0 010 $a1-107-13540-0 010 $a1-280-43457-0 010 $a9786610434572 010 $a0-511-17900-6 010 $a1-139-14863-X 010 $a0-511-06134-X 010 $a0-511-05501-3 010 $a0-511-61511-6 010 $a0-511-30613-X 010 $a0-511-06980-4 035 $a(CKB)1000000000018128 035 $a(EBL)218119 035 $a(OCoLC)70747269 035 $a(SSID)ssj0000184553 035 $a(PQKBManifestationID)11182381 035 $a(PQKBTitleCode)TC0000184553 035 $a(PQKBWorkID)10204676 035 $a(PQKB)10186203 035 $a(UkCbUP)CR9780511615115 035 $a(MiAaPQ)EBC218119 035 $a(Au-PeEL)EBL218119 035 $a(CaPaEBR)ebr10069871 035 $a(CaONFJC)MIL43457 035 $a(EXLCZ)991000000000018128 100 $a20090914d2003|||| uy| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aIterative Krylov methods for large linear systems /$fHenk A. van der Vorst$b[electronic resource] 210 1$aCambridge :$cCambridge University Press,$d2003. 215 $a1 online resource (xiii, 221 pages) $cdigital, PDF file(s) 225 1 $aCambridge monographs on applied and computational mathematics ;$v13 300 $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). 311 $a0-521-18370-7 311 $a0-521-81828-1 320 $aIncludes bibliographical references (p. 205-217) and index. 327 $aCover; Half-title; Series-title; Title; Copyright; Contents; Preface; 1 Introduction; 2 Mathematical preliminaries; 3 Basic iteration methods; 4 Construction of approximate solutions; 5 The Conjugate Gradients method; 6 GMRES and MINRES; 7 Bi-Conjugate Gradients; 8 How serious is irregular convergence?; 9 Bi-CGSTAB; 10 Solution of singular systems; 11 Solution of f (A)x = b with Krylov subspace information; 12 Miscellaneous; 13 Preconditioning; References; Index 330 $aComputational simulation of scientific phenomena and engineering problems often depends on solving linear systems with a large number of unknowns. This book gives insight into the construction of iterative methods for the solution of such systems and helps the reader to select the best solver for a given class of problems. The emphasis is on the main ideas and how they have led to efficient solvers such as CG, GMRES, and BI-CGSTAB. The author also explains the main concepts behind the construction of preconditioners. The reader is encouraged to gain experience by analysing numerous examples that illustrate how best to exploit the methods. The book also hints at many open problems and as such it will appeal to established researchers. There are many exercises that motivate the material and help students to understand the essential steps in the analysis and construction of algorithms. 410 0$aCambridge monographs on applied and computational mathematics ;$v13. 606 $aIterative methods (Mathematics) 606 $aLinear systems 615 0$aIterative methods (Mathematics) 615 0$aLinear systems. 676 $a511/.4 700 $aVorst$b H. A. van der$f1944-$0725355 801 0$bUkCbUP 801 1$bUkCbUP 906 $aBOOK 912 $a9910449676303321 996 $aIterative Krylov methods for large linear systems$91415811 997 $aUNINA