CS 290H: Sparse Matrix Algorithms - PowerPoint PPT Presentation

1 / 10
About This Presentation
Title:

CS 290H: Sparse Matrix Algorithms

Description:

... matrix algorithms on many 2-dimensional physical problems. ... There's also a 3-dimensional model problem. n1/2. Solving Poisson's equation for temperature ... – PowerPoint PPT presentation

Number of Views:68
Avg rating:3.0/5.0
Slides: 11
Provided by: JohnGi84
Category:

less

Transcript and Presenter's Notes

Title: CS 290H: Sparse Matrix Algorithms


1
CS 290H Sparse Matrix Algorithms
  • John R. Gilbert (gilbert_at_cs.ucsb.edu)
  • www.cs.ucsb.edu/gilbert/cs290

2
The (2-dimensional) model problem
  • Graph is a regular square grid with n k2
    vertices.
  • Corresponds to matrix for regular 2D finite
    difference mesh.
  • Gives good intuition for behavior of sparse
    matrix algorithms on many 2-dimensional physical
    problems.
  • Theres also a 3-dimensional model problem.

3
Solving Poissons equation for temperature
  • For each i from 1 to n, except on the boundaries
  • x(i-k2) x(i-k) x(i-1) 6x(i) x(i1)
    x(ik) x(ik2) 0
  • n equations in n unknowns Ax b
  • Each row of A has at most 7 nonzeros.

4
Link analysis of the web
  • Web page vertex
  • Link directed edge
  • Link matrix Aij 1 if page i links to page j

5
Web graph PageRank (Google) Brin,
Page
An important page is one that many important
pages point to.
  • Markov process follow a random link most of the
    time otherwise, go to any page at random.
  • Importance stationary distribution of Markov
    process.
  • Transition matrix is pA (1-p)ones(size(A)),
    scaled so each column sums to 1.
  • Importance of page i is the i-th entry in the
    principal eigenvector of the transition matrix.
  • But, the matrix is 10,000,000,000 by
    10,000,000,000.

6
A Page Rank Matrix
  • Importance ranking of web pages
  • Stationary distribution of a Markov chain
  • Power method matvec and vector arithmetic
  • MatlabP page ranking demo (from SC03) on
    a web crawl of mit.edu (170,000 pages)

7
Graphs and Sparse Matrices Cholesky
factorization
Fill new nonzeros in factor
Symmetric Gaussian elimination for j 1 to n
add edges between js higher-numbered
neighbors
G(A)chordal
G(A)
8
The Landscape of Sparse Axb Solvers
D
9
Complexity of linear solvers
Time to solve model problem (Poissons equation)
on regular mesh
10
CS 290H Administrivia
  • Course web site www.cs.ucsb.edu/gilbert/cs290
  • Join the email (Google) discussion group!! (see
    web site)
  • First homework is on the web site, due next
    Monday
  • About 5 weekly homeworks, then a final project
    (implementation experiment, application, or
    survey paper)
  • Assigned readings some online, some from Davis
    book.
Write a Comment
User Comments (0)
About PowerShow.com