Krylov Solvers for Linear Algebraic Systems

Author:   C G Broyden ,  Maria Teresa Vespucci ,  Charles George Broyden
Publisher:   Elsevier Science
ISBN:  

9781281008855


Pages:   330
Publication Date:   10 January 2010
Format:   Electronic book text
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $1188.00 Quantity:  
Add to Cart

Share |

Krylov Solvers for Linear Algebraic Systems


Add your own review!

Overview

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 ofthe block conjugate-gradient algorithm and it is this observation thatpermits the unification of the theory. The two major sub-classes of thosemethods, the Lanczos and the Hestenes-Stiefel, are developed in parallel asnatural generalisations of the Orthodir (GCR) and Orthomin algorithms. Theseare themselves based on Arnoldi's algorithm and a generalised Gram-Schmidtalgorithm and their properties, in particular their stability properties, are determined by the two matrices that define the block conjugate-gradientalgorithm. These are the matrix of coefficients and the preconditioningmatrix. 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

Full Product Details

Author:   C G Broyden ,  Maria Teresa Vespucci ,  Charles George Broyden
Publisher:   Elsevier Science
Imprint:   Elsevier Science
ISBN:  

9781281008855


ISBN 10:   1281008850
Pages:   330
Publication Date:   10 January 2010
Audience:   General/trade ,  General
Format:   Electronic book text
Publisher's Status:   Active
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Table of Contents

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List