## Computer solution of large sparse positive definite systems |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Chapter 3Some Graph Theory Notation and Its Use in the Study | 36 |

Contents ix | 45 |

Chapter 4 Band and Envelope Methods | 48 |

Copyright | |

7 other sections not shown

### Common terms and phrases

100 CONTINUE adjacency list adjacency structure adjacent set ADJNCY array pair CCSIZE Ceeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee Cholesky factor column computation connected component COOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO corresponding data structure deﬁned described in Section DIAG diagonal blocks elimination graphs ELSLV ENvszE example Figure ﬁll ﬁlled ﬁnd ﬁnding ﬁrst FNROOT given graph G IBAND IFIRST implementation INPUT PARAMETERS INTEGER XADJ(1 INVP IsToP IsTRT JSTOP JSTRT KSTRT Lemma loop D0 LVLEND MARKER MASK method minimum degree algorithm modiﬁcation NABOR NBLKS NBRHD NEQNS NHDszE NLVL node NODLVL Nonz nonzero NZSUBS off-diagonal blocks one-way dissection ordering operation count partitioned matrix PERM permutation permutation matrix positive deﬁnite primary storage problems proﬁle quotient graph quotient tree RCHSET RcHszE reachable sets RETURN END solution Solve sparse matrix Step storage requirements storage scheme stored subgraph subroutine subscripts subset supernode symmetric symmetric matrix temporary vector Theorem tree partitioning triangular factor vector XADJ XADJ(NODE XBLK XENV zero