000 02229nam a22003618i 4500
001 CR9780511615115
003 UkCbUP
005 20200124160221.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 090914s2003||||enk o ||1 0|eng|d
020 _a9780511615115 (ebook)
020 _z9780521818285 (hardback)
020 _z9780521183703 (paperback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA297.8
_b.V67 2003
082 0 0 _a511/.4
_221
100 1 _aVorst, H. A. van der,
_d1944-
_eauthor.
245 1 0 _aIterative Krylov methods for large linear systems /
_cHenk A. van der Vorst.
264 1 _aCambridge :
_bCambridge University Press,
_c2003.
300 _a1 online resource (xiii, 221 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aCambridge monographs on applied and computational mathematics ;
_v13
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520 _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.
650 0 _aIterative methods (Mathematics)
650 0 _aLinear systems.
776 0 8 _iPrint version:
_z9780521818285
830 0 _aCambridge monographs on applied and computational mathematics ;
_v13.
856 4 0 _uhttps://doi.org/10.1017/CBO9780511615115
999 _c516786
_d516784