Sparse Matrix Technology

Sparse Matrix Technology presents the methods, concepts, ideas, and applications of sparse matrix technology. The text provides the fundamental methods, procedures, techniques, and applications of sparse matrix technology in software development. The book covers topics on storage schemes and computational techniques needed for sparse matrix technology; sparse matrix methods and algorithms for the direct solution of linear equations; and algorithms for different purposes connected with sparse matrix technology. Engineers, programmers, analysts, teachers, and students in the computer sciences will find the book interesting. Content: Front Matter, Page iii Copyright, Page iv Preface, Pages v-viii Dedication, Page xiv Introduction, Pages 1-3 CHAPTER 1 - Fundamentals, Pages 4-37 CHAPTER 2 - Linear Algebraic Equations, Pages 38-68 CHAPTER 3 - Numerical Errors in Gauss Elimination, Pages 69-93 CHAPTER 4 - Ordering for Gauss Elimination: Symmetric Matrices, Pages 94-158 CHAPTER 5 - Ordering for Gauss Elimination: General Matrices, Pages 159-195 CHAPTER 6 - Sparse Eigenanalysis, Pages 196-232 CHAPTER 7 - Sparse Matrix Algebra, Pages 233-270 CHAPTER 8 - Connectivity and Nodal Assembly, Pages 271-287 CHAPTER 9 - General Purpose Algorithms, Pages 288-300 References, Pages 301-312 Subject Index, Pages 313-321 The fundamental methods and procedures of sparse matrix technology are introduced and described in detail, with discussion reaching the point where the reader can understand the specialized literature on each subject. Wherever possible, a unified treatment is provided. The purpose of the book is to bring sparse matrix technology within reach of engineers, programmers, analysts, teachers, and students. It should be helpful to anyone wishing to develop sparse matrix software, or improve the understanding of software currently employed. Teachers will find an elementary presentation of sparse matrix methods, ideas, and examples of application at a professional level