Ralph Wiloughby9780898715231, 0898715237
Although preserving orthogonality has been the golden rule in linear algebra, most of the algorithms in this book conform to that rule only locally, resulting in markedly reduced memory requirements. Additionally, most of the algorithms discussed separate the eigenvalue (singular value) computations from the corresponding eigenvector (singular vector) computations. This separation prevents losses in accuracy that can occur in methods which, in order to be able to compute further into the spectrum, use successive implicit deflation by computed eigenvector or singular vector approximations.
This book continues to be useful to the mathematical, scientific, and engineering communities as a reservoir of information detailing the nonclassical side of Lanczos algorithms and as a presentation of what continues to be the most efficient methods for certain types of large-scale eigenvalue computations.
An online version of Vol. II: Programs, which contains the FORTRAN code and documentation for each of the Lanczos procedures discussed in Vol. I, can be found at the numerical analysis community repository, under the term “lanczos.”
Table of contents :
Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. I: Theory……Page 1
Table of Contents……Page 8
PREFACE TO THE CLASSICS EDITION……Page 12
PREFACE……Page 16
INTRODUCTION……Page 18
CHAPTER 0 PRELIMINARIES: NOTATION AND DEFINITIONS……Page 22
CHAPTER 1 REAL ‘SYMMETRIC’ PROBLEMS……Page 38
CHAPTER 2 LANCZOS PROCEDURES, REAL SYMMETRIC PROBLEMS……Page 53
CHAPTER 3 TRIDIAGONAL MATRICES……Page 97
CHAPTER 4 LANCZOS PROCEDURES WITH NO REORTHOGONALIZATION FOR REAL SYMMETRIC PROBLEMS……Page 113
CHAPTER 5 REAL RECTANGULAR MATRICES……Page 185
CHAPTER 6 NONDEFECTIVE COMPLEX SYMMETRIC MATRICES……Page 215
CHAPTER 7 BLOCK LANCZOS PROCEDURES, REAL SYMMETRIC MATRICES……Page 231
REFERENCES……Page 273
AUTHOR INDEX……Page 290
SUBJECT INDEX……Page 293
Reviews
There are no reviews yet.