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
Author(s): Charles George Broyden and Maria Teresa Vespucci (Eds.)
Series: Studies in Computational Mathematics 11
Publisher: Elsevier, Academic Press
Year: 2004
Language: English
Pages: 1-330
Tags: Математика;Вычислительная математика;Вычислительные методы линейной алгебры;
Content:
Preface
Pages vii-viii
C.G. Broyden
Chapter 1 Introduction
Pages 1-20
Chapter 2 The long recurrences Original Research Article
Pages 21-41
Chapter 3 The short recurrences Original Research Article
Pages 43-76
Chapter 4 The Krylov aspects Original Research Article
Pages 77-103
Chapter 5 Transpose-free methods Original Research Article
Pages 105-115
Chapter 6 More on QMR Original Research Article
Pages 117-132
Chapter 7 Look-ahead methods Original Research Article
Pages 133-150
Chapter 8 General block methods Original Research Article
Pages 151-162
Chapter 9 Some numerical considerations Original Research Article
Pages 163-171
Chapter 10 And in practice…? Original Research Article
Pages 173-192
Chapter 11 Preconditioning Original Research Article
Pages 193-278
Chapter 12 Duality Original Research Article
Pages 279-285
Appendix A Reduction of upper Hessenberg matrix to upper triangular form
Pages 287-291
Appendix B Schur complements
Pages 293-294
Appendix C The Jordan form
Pages 295-296
Appendix D Chebychev polynomials
Pages 297-298
Appendix E The companion matrix
Pages 299-300
Appendix F The algorithms
Pages 301-311
Appendix G Guide to the graphs
Pages 313-314
References
Pages 315-325
Index
Pages 327-330