Solves a set of sparse, symmetric linear equations using a conjugate gradient type method.

Solves sparse linear equations using a conjugate-gradient type method.

Updates a dense square factorization L*C = U, when rows and columns of C are added, deleted or replaced.

By Rick Ottolini, based on an article by Gilbert Strang.

Stanford Exploration Project library, containing basic seismic data processing routines such as phase shift migration and velocity stacking. Includes documentation, source code, and binary packages for Mac OS X and Cygwin.

By CCRMA: The Stanford University Center for Computer Research in Music and Acoustics.

This paper by Sepandar Kamvar, Taher Haveliwala, Chris Manning, and Gene Golub, published in WWW13, presents an algorithm to speed up the computation of PageRank by making some initial approximations.

This paper by Sepandar Kamvar, Taher Haveliwala, Chris Manning, and Gene Golub presents an algorithm to vastly speed up the computation of PageRank.

Taher H. Haveliwala, Sepandar D. Kamvar, and Glen Jeh compare three approaches to personaliizing PageRank.

PhD thesis by Kahn Mason on methods of discovering groups of websites that collude to boost their reputations, distorting the results of the PageRank algorithm. Stanford University.