Home » Nonfiction » BroydenCharles George » Krylov Solvers for Linear Algebraic Systems: Krylov Solvers

August 25 , 2007

Krylov Solvers for Linear Algebraic Systems: Krylov Solvers


The first four chapters of this book give a comprehensive and unified theory of the Krylov methods. Many of these are shown to be particular examples of
the block conjugate-gradient algorithm and it is this observation that
permits the unification of the theory. The two major sub-classes of those
methods, the Lanczos and the Hestenes-Stiefel, are developed in parallel as
natural generalisations of the Orthodir (GCR) and Orthomin algorithms. These
are themselves based on Arnoldi's algorithm and a generalised Gram-Schmidt
algorithm and their properties, in particular their stability properties,
are determined by the two matrices that define the block conjugate-gradient
algorithm. These are the matrix of coefficients and the preconditioning
Download doc

Read also

Sexy Girls - An erotic photo book - Volume 9

This amazing collection stars dozens of beautiful women, all eager to strip off for you!

In Chapter 5 the"transpose-free" algorithms based on the conjugate-gradient squared algorithm are presented while Chapter 6 examines the various ways in which the QMR technique has been exploited. Look-ahead methods and general block methods are dealt with in Chapters 7 and 8 while Chapter 9 is devoted to error analysis of two basic algorithms.

In Chapter 10 the results of numerical testing of the more important algorithms in their basic forms (i.e. without look-ahead or preconditioning) are presented and these are related to the structure of the algorithms and the general theory. Graphs illustrating the performances of various algorithm/problem combinations are given via a CD-ROM.

Chapter 11, by far the longest, gives a survey of preconditioning techniques. These range from the old idea of polynomial preconditioning via SOR and ILU preconditioning to methods like SpAI, AInv and the multigrid methods that were developed specifically for use with parallel computers. Chapter 12 is devoted to dual algorithms like Orthores and the reverse algorithms of Hegedus. Finally certain ancillary matters like reduction to Hessenberg form, Chebychev polynomials and the companion matrix are described in a series of appendices.

· comprehensive and unified approach
· up-to-date chapter on preconditioners
· complete theory of stability
· includes dual and reverse methods
· comparison of algorithms on CD-ROM
· objective assessment of algorithms
Show more...

How to download book

Buy this book

You can buy this book now only for $172.79. This is the lowest price for this book.

Buy book

Download book free

If you want to download this book for free, please register, approve your account and get one book for free.


After that you may download book «Krylov Solvers for Linear Algebraic Systems: Krylov Solvers»:

Download Microsoft Reader (LIT):


Download Sony BookReader: