Muutke küpsiste eelistusi

Direct Methods for Sparse Linear Systems illustrated edition [Pehme köide]

  • Formaat: Paperback / softback, 119 pages, kõrgus x laius x paksus: 251x177x12 mm, kaal: 425 g, Illustrations
  • Sari: Fundamentals of Algorithms No. 2
  • Ilmumisaeg: 30-Sep-2006
  • Kirjastus: Society for Industrial & Applied Mathematics,U.S.
  • ISBN-10: 0898716136
  • ISBN-13: 9780898716139
Teised raamatud teemal:
  • Formaat: Paperback / softback, 119 pages, kõrgus x laius x paksus: 251x177x12 mm, kaal: 425 g, Illustrations
  • Sari: Fundamentals of Algorithms No. 2
  • Ilmumisaeg: 30-Sep-2006
  • Kirjastus: Society for Industrial & Applied Mathematics,U.S.
  • ISBN-10: 0898716136
  • ISBN-13: 9780898716139
Teised raamatud teemal:
“The sparse backslash book.” “Everything you wanted to know but never dared to ask about modern direct linear solvers.” — Chen Greif, Assistant Professor, Department of Computer Science, University of British Columbia.“Overall, the book is magnificent. It fills a long-felt need for an accessible textbook on modern sparse direct methods. Its choice of scope is excellent…” John Gilbert, Professor, Department of Computer Science, University of California, Santa Barbara.Computational scientists often encounter problems requiring the solution of sparse systems of linear equations. Attacking these problems efficiently requires an in-depth knowledge of the underlying theory, algorithms, and data structures found in sparse matrix software libraries. Here, Davis presents the fundamentals of sparse matrix algorithms to provide the requisite background. The book includes CSparse, a concise downloadable sparse matrix package that illustrates the algorithms and theorems presented in the book and equips readers with the tools necessary to understand larger and more complex software packages.With a strong emphasis on MATLAB® and the C programming language, Direct Methods for Sparse Linear Systems equips readers with the working knowledge required to use sparse solver packages and write code to interface applications to those packages. The book also explains how MATLAB performs its sparse matrix computations.Audience This invaluable book is essential to computational scientists and software developers who want to understand the theory and algorithms behind modern techniques used to solve large sparse linear systems. The book also serves as an excellent practical resource for students with an interest in combinatorial scientific computing.Preface; Chapter 1: Introduction; Chapter 2: Basic algorithms; Chapter 3: Solving triangular systems; Chapter 4: Cholesky factorization; Chapter 5: Orthogonal methods; Chapter 6: LU factorization; Chapter 7: Fill-reducing orderings; Chapter 8: Solving sparse linear systems; Chapter 9: CSparse; Chapter 10: Sparse matrices in MATLAB; Appendix: Basics of the C programming language; Bibliography; Index.





Essential guide for computational scientists and software developers to the theory and algorithms for solving large sparse linear systems.

Arvustused

'Everything you wanted to know but never dared to ask about modern direct linear solvers.' Chen Greif, University of British Columbia 'Overall, the book is magnificent. It fills a long-felt need for an accessible textbook on modern sparse direct methods. Its choice of scope is excellent ...' John Gilbert, University of California, Santa Barbara

Preface xi
Introduction
1(6)
Linear algebra
2(2)
Graph theory, algorithms, and data structures
4(2)
Further reading
6(1)
Basic algorithms
7(20)
Sparse matrix data structures
7(2)
Matrix-vector multiplication
9(1)
Utilities
10(2)
Triplet form
12(2)
Transpose
14(1)
Summing up duplicate entries
15(1)
Removing entries from a matrix
16(1)
Matrix multiplication
17(2)
Matrix addition
19(1)
Vector permutation
20(1)
Matrix permutation
21(1)
Matrix norm
22(1)
Reading a matrix from a file
23(1)
Printing a matrix
23(1)
Sparse matrix collections
24(1)
Further reading
24(3)
Exercises
24(3)
Solving triangular systems
27(10)
A dense right-hand side
27(2)
A sparse right-hand side
29(6)
Further reading
35(2)
Exercises
35(2)
Cholesky factorization
37(32)
Elimination tree
38(5)
Sparse triangular solve
43(1)
Postordering a tree
44(2)
Row counts
46(6)
Column counts
52(4)
Symbolic analysis
56(2)
Up-looking Cholesky
58(2)
Left-looking and supernodal Cholesky
60(2)
Right-looking and multifrontal Cholesky
62(1)
Modifying a Cholesky factorization
63(3)
Further reading
66(3)
Exercises
67(2)
Orthogonal methods
69(14)
Householder reflections
69(1)
Left-and right-looking QR factorization
70(1)
Householder-based sparse QR factorization
71(8)
Givens rotations
79(1)
Row-merge sparse QR factorization
79(2)
Further reading
81(2)
Exercises
82(1)
LU factorization
83(16)
Upper bound on fill-in
83(2)
Left-looking LU
85(3)
Right-looking and multifrontal LU
88(6)
Further reading
94(5)
Exercises
95(4)
Fill-reducing orderings
99(36)
Minimum degree ordering
99(13)
Maximum matching
112(6)
Block triangular form
118(4)
Dulmage-Mendelsohn decomposition
122(5)
Bandwidth and profile reduction
127(1)
Nested dissection
128(2)
Further reading
130(5)
Exercises
133(2)
Solving sparse linear systems
135(10)
Using a Cholesky factorization
135(1)
Using a QR factorization
136(2)
Using an LU factorization
138(1)
Using a Dulmage-Mendelsohn decomposition
138(2)
MATLAB sparse backslash
140(1)
Software for solving sparse linear systems
141(4)
Exercises
144(1)
CSparse
145(24)
Primary CSparse routines and definitions
146(3)
Secondary CSparse routines and definitions
149(5)
Tertiary CSparse routines and definitions
154(4)
Examples
158(11)
Sparse matrices in MATLAB
169(18)
Creating sparse matrices
169(3)
Sparse matrix functions and operators
172(4)
CSparse MATLAB interface
176(6)
Examples
182(4)
Further reading
186(1)
Exercises
186(1)
Basics of the C programming language 187(8)
Bibliography 195(16)
Index 211


Timothy A. Davis is an Associate Professor in Computer and Information Science and Engineering at the University of Florida. He is the author of a suite of sparse matrix packages that are widely used in industry, academia, and government research labs, and related articles in SIAM, ACM, and IEEE journals. He is the co-author of a well-used introduction to MATLAB, the MATLAB Primer (Chapman & Hall/CRC Press, 2005). He is a member of the editorial boards of the IEEE Transactions on Parallel and Distributed Systems, and Computational Optimization and Applications.