Chebyshev acceleration of the GeneRank algorithm

zbMath1288.65036MaRDI QIDQ2450052

Michele Benzi, Verena Kuhlemann

Publication date: 14 May 2014

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol40/abstract_vol40_pp311-320.html

zbMATH Keywords

algorithmconvergence accelerationconjugate gradientscomputational genomicspolynomials of best uniform approximationChebyshev semi-iterationGeneRank methodlarge, sparse linear systemPageRank iteration

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Searching and sorting (68P10) Iterative numerical methods for linear systems (65F10) Genetics and epigenetics (92D10)

Related Items (3)

A cost-effective smoothed multigrid with modified neighborhood-based aggregation for Markov chains ⋮ Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems ⋮ Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration

Uses Software

• CONTEST
• testmatrix
• CSparse
• GeneRank

This page was built for publication: Chebyshev acceleration of the GeneRank algorithm