{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

sparse - CIS 6930/4930 Sparse matrix algorithms Timothy A...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CIS 6930/4930: Sparse matrix algorithms Timothy A. Davis Computer and Information Science and Engineering Department, University of Florida. email: [email protected] http://www.cise.ufl.edu/ davis. Fall 2007 1 Course Overview Students in any discipline that uses scientific computing methods will ben- efit from this course. A wide range of problems in science and engineering require fundamental matrix computations for their solution, and these ma- trices are often mostly zero. The world’s largest sparse matrix arises in Google’s web page ranking problem. About once a month, Google finds an eigenvector of a 8 billion by 8 billion sparse matrix that represents the connectivity of the web. Other sparse matrix problems arise in circuit and device simulation, finite element methods, linear programming and other optimization problems, acoustics, electromagnetics, computational fluid dy- namics, financial portfolio optimization, structural analysis, and quantum mechanics, to name a few.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}