Professional Documents
Culture Documents
Day 1: Overview Matlab and examples Data structures Ax=b Sparse matrices and graphs Fill-reducing matrix permutations Matching and block triangular form
(Demo in Matlab) Matlab sprand spy sparse, full matrix arithmetic and indexing examples of sparse matrices from different applications (from UF site)
Data structures
31 0 41 0 59 26 53 0 0 31 41 59 26 53
Is A symmetric with positive diagonal elements? yes => attempt Cholesky after symmetric minimum degree
Otherwise => use LU on A(:, colamd(A))
8 4
6 10
10
G(A)
G+(A)
[chordal]
Elimination Tree
1 3 7 10 9 8 4 6 10 6 9 5 2 5 4 8 2 7 3 1
Cholesky factor
G+(A)
T(A)
Square, full rank A: [p, q, r] = dmperm(A); A(p,q) has nonzero diagonal and is in block upper triangular form also, strongly connected components of a directed graph also, connected components of an undirected graph
Arbitrary A: [p, q, r, s] = dmperm(A); maximum-size matching in a bipartite graph minimum-size vertex cover in a bipartite graph decomposition into strong Hall blocks
n1/2
n1/3
2D
Space (fill): Time (flops):
Iterative y = Ay
More General
More Robust