000			a
999			_c29744 _d29744
008			191121b xxu||||| |||| 00| 0 eng d
020			_a9783319284811
082			_a512.9434 _bHAC
100			_aHackbusch, Wolfgang
245			_aIterative solution of large sparse systems of equations
260			_aSwitzerland _bSpringer _c2016
300			_axxiii, 509 p. _bill. _c25 cm.
365			_b129.99 _cEUR _d82.00
490			_aApplied mathematical sciences _vv. 95
504			_aIncludes bibliographical references and index.
520			_aIn the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.
650			_aSparse Matrices
650			_aIterative Methods
650			_aDifferential Equations
650			_aNumerical solutions
942			_2ddc _cBK