 |
|
|
Item Details
| Title:
|
KRYLOV SOLVERS FOR LINEAR ALGEBRAIC SYSTEMS
KRYLOV SOLVERS |
| Volume: |
Volume 11 |
| By: |
C.G. Broyden, Maria Th. Vespucci |
| Format: |
Hardback |
| List price:
|
£150.00 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0444514740 |
| ISBN 13: |
9780444514745 |
| Publisher: |
ELSEVIER SCIENCE & TECHNOLOGY |
| Pub. date: |
8 September, 2004 |
| Series: |
Studies in Computational Mathematics |
| Pages: |
342 |
| Description: |
Includes chapters which offer a unified theory of the Krylov methods. This book presents "transpose-free" algorithms based on the conjugate-gradient squared algorithm. It also examines the various ways in which the QMR technique has been exploited. |
| Synopsis: |
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. |
| Publication: |
UK |
| Imprint: |
Elsevier Science Ltd |
| Returns: |
Non-returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|