Sparse matrix technology:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
London [u.a.]
Acad. Press
1984
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIII, 321 S. graph. Darst. |
| ISBN: | 0125575807 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002300636 | ||
| 003 | DE-604 | ||
| 005 | 20090908 | ||
| 007 | t | ||
| 008 | 890928s1984 d||| |||| 00||| eng d | ||
| 020 | |a 0125575807 |9 0-12-557580-7 | ||
| 035 | |a (OCoLC)11108548 | ||
| 035 | |a (OCoLC)251552494 | ||
| 035 | |a (DE-599)BVBBV002300636 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-384 |a DE-703 |a DE-739 |a DE-20 |a DE-29T |a DE-898 |a DE-19 |a DE-706 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA188 | |
| 082 | 0 | |a 512.9/434 |2 19 | |
| 084 | |a SK 220 |0 (DE-625)143224: |2 rvk | ||
| 084 | |a MAT 659f |2 stub | ||
| 084 | |a 65Fxx |2 msc | ||
| 084 | |a 65F15 |2 msc | ||
| 084 | |a 65F05 |2 msc | ||
| 084 | |a 65F50 |2 msc | ||
| 100 | 1 | |a Pissanetzky, Sergio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Sparse matrix technology |c Sergio Pissanetzky |
| 264 | 1 | |a London [u.a.] |b Acad. Press |c 1984 | |
| 300 | |a XIII, 321 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Matrices éparses - Informatique | |
| 650 | 7 | |a algèbre linéaire |2 inriac | |
| 650 | 7 | |a algèbre matricielle |2 inriac | |
| 650 | 7 | |a matrice creuse |2 inriac | |
| 650 | 7 | |a élimination Gauss |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Sparse matrices |x Data processing | |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Schwach besetzte Matrix |0 (DE-588)4056053-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Schwach besetzte Matrix |0 (DE-588)4056053-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Schwach besetzte Matrix |0 (DE-588)4056053-3 |D s |
| 689 | 1 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001512015&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 940 | 1 | |q TUB-nvmb | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001512015 | ||
Datensatz im Suchindex
| _version_ | 1804116761495207936 |
|---|---|
| adam_text | Contents
Preface v
Introduction 1
Chapter 1 Fundamentals
1.1 Introduction .......... 4
1.2 Storage of arrays, lists, stacks and queues .... 5
1.3 Storage of lists of integers 8
1.4 Representation and storage of graphs 10
1.5 Diagonal storage of band matrices 13
1.6 Envelope storage of symmetric matrices 14
1.7 Linked sparse storage schemes 16
1.8 The sparse row wise format ....... 20
1.9 Ordered and unordered representations 22
1.10 Sherman s compression ........ 23
1.11 Storage of block partitioned matrices ..... 25
1.12 Symbolic processing and dynamic storage schemes ... 27
1.13 Merging sparse lists of integers ...... 30
1.14 The multiple switch technique 31
1.15 Addition of sparse vectors with the help of an expanded real
accumulator .......... 32
1.16 Addition of sparse vectors with the help of an expanded integer
array of pointers 35
1.17 Scalar product of two sparse vectors with the help of an array
of pointers .......... 36
Chapter 2 Linear Algebraic Equations
2.1 Introduction 38
2.2 Some definitions and properties 41
2.3 Elementary matrices and triangular matrices .... 43
2.4 Some properties of elementary matrices ..... 45
2.5 Some properties of triangular matrices 46
2.6 Permutation matrices 48
ix
X CONTENTS
2.7 Gauss elimination by columns 49
2.8 Gauss elimination by rows 53
2.9 Gauss Jordan elimination 55
2.10 Relation between the elimination form of the inverse and the
product form of the inverse 57
2.11 Cholesky factorization of a symmetric positive definite matrix 58
2.12 Practical implementation of Cholesky factorization. . . 60
2.13 Forward and backward substitution . . . . . 61
2.14 Cost considerations 62
2.15 Numerical examples 65
Chapter 3 Numerical Errors in Gausss Elimination
3.1 Introduction 69
3.2 Numerical errors in floating point operations . . . . 71
3.3 Numerical errors in sparse factorization 74
3.4 Numerical errors in sparse substitution 79
3.5 The control of numerical errors 84
3.6 Numerical stability and pivot selection 86
3.7 Monitoring or estimating element growth .... 90
3.8 Scaling 91
Chapter 4 Ordering for Gauss Elimination: Symmetric Matrices
4.1 Introduction: Statement of the problem 94
4.2 Basic notions of graph theory ....... 97
4.3 Breadth first search and adjacency level structures . . .103
4.4 Finding a pseudoperipheral vertex and a narrow level structure
of a graph 105
4.5 Reducing the bandwidth of a symmetric matrix . . .106
4.6 Reducing the profile of a symmetric matrix . . . .109
4.7 Graph theoretical background of symmetric Gauss elimination 112
4.8 The minimum degree algorithm 116
4.9 Tree partitioning of a symmetric sparse matrix . . .121
4.10 Nested dissection 125
4.11 Properties of nested dissection orderings . . . . 130
4.12 Generalized nested dissection 134
4.13 One way dissection for finite element problems . . .135
4.14 Orderings for the finite element method . . . . .141
4.15 Depth first search of an undirected graph . . . .146
4.16 Lexicographic search 152
4.17 Symmetric indefinite matrices 157
CONTENTS xi
Chapter 5 Ordering for Gauss Elimination: General Matrices
5.1 Introduction: Statement of the problem 159
5.2 Graph theory for unsymmetric matrices 162
5.3 The strong components of a digraph 165
5.4 Depth first search of a digraph 169
5.5 Breadth first search of a digraph and directed adjacency level
structures 172
5.6 Finding a maximal set of vertex disjoint paths in an acyclic
digraph 174
5.7 Finding a transversal: the algorithm of Hall . . . .176
5.8 Finding a transversal: the algorithm of Hopcroft and Karp . 179
5.9 The algorithm of Sargent and Westerberg for finding the strong
components of a digraph. . . . . . . .185
5.10 The algorithm of Tarjan for finding the strong components of a
digraph 187
5.11 Pivoting strategies for unsymmetric matrices . . . .191
5.12 Other methods and available software 194
Chapter 6 Sparse Eigenanalysis
6.1 Introduction 196
6.2 The Rayleigh quotient 200
6.3 Bounds for eigenvalues 202
6.4 The bisection method for eigenvalue calculations . . . 204
6.5 Reduction of a general matrix....... 205
6.6 Reduction of a symmetric band matrix to tridiagonal form . 207
6.7 Eigenanalysis of tridiagonal and Hessenberg matrices . . 209
6.8 Direct and inverse iteration 210
6.9 Subspaces and invariant subspaces 214
6.10 Simultaneous iteration 216
6.11 Lanczos algorithm . ¦ • . . 220
6.12 Lanczos algorithm in practice . ...... 225
6.13 Block Lanczos and band Lanczos algorithms .... 227
6.14 Trace minimization 230
6.15 Eigenanalysis of hermitian matrices 230
6.16 Unsymmetric eigenproblems 231
Chapter 7 Sparse Matrix Algebra
7.1 Introduction 234
7.2 Transposition of a sparse matrix 236
Xii CONTENTS
7.3 Algorithm for the transposition of a general sparse matrix . 238
7.4 Ordering a sparse representation ...... 239
7.5 Permutation of rows or columns of a sparse matrix: First
procedure .......... 240
7.6 Permutation of rows or columns of a sparse matrix: Second
procedure 241
7.7 Ordering of the upper representation of a sparse symmetric
matrix ........... 242
7.8 Addition of sparse matrices ....... 242
7.9 Example of addition of two sparse matrices .... 243
7.10 Algorithm for the symbolic addition of two sparse matrices with
N rows and M columns ........ 245
7.11 Algorithm for the numerical addition of two sparse matrices
with N rows 246
7.12 Product of a general sparse matrix by a column vector . 248
7.13 Algorithm for the product of a general sparse matrix by a full
column vector.......... 249
7.14 Product of a row vector by a general sparse matrix. . . 249
7.15 Example of product of a full row vector by a general sparse
matrix 250
7.16 Algorithm for the product of a full row vector by a general
sparse matrix . . . . . . . . . .251
7.17 Product of a symmetric sparse matrix by a column vector . 251
7.18 Algorithms for the product of a symmetric sparse matrix by a full
column vector.......... 252
7.19 Multiplication of sparse matrices ...... 253
7.20 Example of product of two matrices which are stored by rows 254
7.21 Algorithm for the symbolic multiplication of two sparse
matrices given in row wise format ...... 255
7.22 Algorithm for the numerial multiplication of two sparse
matrices given in row wise format ...... 256
7.23 Triangular factorization of a sparse symmetric matrix given in
row wise format ......... 258
7.24 Numerical triangular factorization of a sparse symmetric matrix
given in row wise format. . . . . . . .261
7.25 Algorithm for the symbolic triangular factorization of a sym¬
metric sparse matrix A 263
7.26 Algorithm for the numerical triangular factorization of a
symmetric positive definite sparse matrix A .... 265
7.27 Example of forward and backward substitution . . . 268
7.28 Algorithm for the solution of the system UTDUx = b . .269
contents xiii
Chapter 8 Connectivity and Nodal Assembly
8.1 Introduction 271
8.2 Boundary conditions for scalar problems. .... 274
8.3 Boundary conditions for vector problems .... 275
8.4 Example of a connectivity matrix ...... 279
8.5 Example of a nodal assembly matrix ..... 280
8.6 Algorithm for the symbolic assembly of a symmetric nodal
assembly matrix ... . . . . . . . 282
8.7 Algorithm for the numerical assembly of an element matrix and
vector into the nodal assembly matrix A and right hand vector
b: Symmetric case ......... 283
8.8 Algorithm for the numerical assembly of an element matrix and
vector into the nodal assembly matrix A and right hand vector
b: General case 286
Chapter 9 General Purpose Algorithms
9.1 Introduction 288
9.2 Multiplication of the inverse of a lower triangular matrix by a
general matrix 289
9.3 Algorithm for the symbolic multiplication of the inverse of a
lower triangular matrix U T by a general matrix B . . . 290
9.4 Algorithm for the numerical multiplication of the inverse of a
lower triangular matrix U~T by a general matrix B . . . 292
9.5 Algorithm for the multiplication of the inverse of an upper
triangular unit diagonal matrix U by a full vector x . . 293
9.6 Algorithm for the multiplication of the transpose inverse of an
upper triangular unit diagonal matrix U by a full vector . 294
9.7 Solution of linear equations by the Gauss Seidel iterative
method 295
9.8 Algorithm for the iterative solution of linear equations by the
Gauss Seidel method 295
9.9 Checking the representation of a sparse matrix . . . 297
9.10 Printing or displaying a sparse matrix 298
9.11 Algorithm for transforming a RR(C)U of a symmetric matrix
into a RR(U)U of the same matrix 298
9.12 Algorithm for the pre multiplication of a sparse matrix A by a
diagonal matrix D 299
9.13 Algorithm for copying a sparse matrix from I A, JA, AN to IB,
JB, BN 300
References 301
Subject Index 313
|
| any_adam_object | 1 |
| author | Pissanetzky, Sergio |
| author_facet | Pissanetzky, Sergio |
| author_role | aut |
| author_sort | Pissanetzky, Sergio |
| author_variant | s p sp |
| building | Verbundindex |
| bvnumber | BV002300636 |
| callnumber-first | Q - Science |
| callnumber-label | QA188 |
| callnumber-raw | QA188 |
| callnumber-search | QA188 |
| callnumber-sort | QA 3188 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 220 |
| classification_tum | MAT 659f |
| ctrlnum | (OCoLC)11108548 (OCoLC)251552494 (DE-599)BVBBV002300636 |
| dewey-full | 512.9/434 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512.9/434 |
| dewey-search | 512.9/434 |
| dewey-sort | 3512.9 3434 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02008nam a2200553 c 4500</leader><controlfield tag="001">BV002300636</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090908 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1984 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0125575807</subfield><subfield code="9">0-12-557580-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)11108548</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)251552494</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002300636</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512.9/434</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 220</subfield><subfield code="0">(DE-625)143224:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 659f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65Fxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65F15</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65F05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65F50</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pissanetzky, Sergio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sparse matrix technology</subfield><subfield code="c">Sergio Pissanetzky</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London [u.a.]</subfield><subfield code="b">Acad. Press</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 321 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices éparses - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algèbre linéaire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algèbre matricielle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">matrice creuse</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">élimination Gauss</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sparse matrices</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schwach besetzte Matrix</subfield><subfield code="0">(DE-588)4056053-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Schwach besetzte Matrix</subfield><subfield code="0">(DE-588)4056053-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Schwach besetzte Matrix</subfield><subfield code="0">(DE-588)4056053-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001512015&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nvmb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001512015</subfield></datafield></record></collection> |
| id | DE-604.BV002300636 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:43:39Z |
| institution | BVB |
| isbn | 0125575807 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001512015 |
| oclc_num | 11108548 251552494 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-29T DE-898 DE-BY-UBR DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-29T DE-898 DE-BY-UBR DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
| physical | XIII, 321 S. graph. Darst. |
| psigel | TUB-nvmb |
| publishDate | 1984 |
| publishDateSearch | 1984 |
| publishDateSort | 1984 |
| publisher | Acad. Press |
| record_format | marc |
| spelling | Pissanetzky, Sergio Verfasser aut Sparse matrix technology Sergio Pissanetzky London [u.a.] Acad. Press 1984 XIII, 321 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Matrices éparses - Informatique algèbre linéaire inriac algèbre matricielle inriac matrice creuse inriac élimination Gauss inriac Datenverarbeitung Sparse matrices Data processing Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Schwach besetzte Matrix (DE-588)4056053-3 gnd rswk-swf Schwach besetzte Matrix (DE-588)4056053-3 s DE-604 Datenverarbeitung (DE-588)4011152-0 s HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001512015&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Pissanetzky, Sergio Sparse matrix technology Matrices éparses - Informatique algèbre linéaire inriac algèbre matricielle inriac matrice creuse inriac élimination Gauss inriac Datenverarbeitung Sparse matrices Data processing Datenverarbeitung (DE-588)4011152-0 gnd Schwach besetzte Matrix (DE-588)4056053-3 gnd |
| subject_GND | (DE-588)4011152-0 (DE-588)4056053-3 |
| title | Sparse matrix technology |
| title_auth | Sparse matrix technology |
| title_exact_search | Sparse matrix technology |
| title_full | Sparse matrix technology Sergio Pissanetzky |
| title_fullStr | Sparse matrix technology Sergio Pissanetzky |
| title_full_unstemmed | Sparse matrix technology Sergio Pissanetzky |
| title_short | Sparse matrix technology |
| title_sort | sparse matrix technology |
| topic | Matrices éparses - Informatique algèbre linéaire inriac algèbre matricielle inriac matrice creuse inriac élimination Gauss inriac Datenverarbeitung Sparse matrices Data processing Datenverarbeitung (DE-588)4011152-0 gnd Schwach besetzte Matrix (DE-588)4056053-3 gnd |
| topic_facet | Matrices éparses - Informatique algèbre linéaire algèbre matricielle matrice creuse élimination Gauss Datenverarbeitung Sparse matrices Data processing Schwach besetzte Matrix |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001512015&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT pissanetzkysergio sparsematrixtechnology |