Square and stretch multigrid for stochastic matrix eigenproblems

Eran Treister, Irad Yavneh

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

A novel multigrid algorithm for computing the principal eigenvector of column-stochastic matrices is developed. The method is based on an approach originally introduced by Horton and Leutenegger (Perform. Eval. Rev. 1994; 22:191-200) whereby the coarse-grid problem is adapted to yield a better and better coarse representation of the original problem. A special feature of the present approach is the squaring of the stochastic matrix-followed by a stretching of its spectrum-just prior to the coarse-grid correction process. This procedure is shown to yield good convergence properties, even though a cheap and simple aggregation is used for the restriction and prolongation matrices, which is important for maintaining competitive computational costs. A second special feature is a bottom-up procedure for defining coarse-grid aggregates.

Original languageEnglish
Pages (from-to)229-251
Number of pages23
JournalNumerical Linear Algebra with Applications
Volume17
Issue number2-3
DOIs
StatePublished - 1 Apr 2010
Externally publishedYes

Keywords

  • Algebraic multigrid
  • Markov chains
  • Smoothed aggregation

Fingerprint

Dive into the research topics of 'Square and stretch multigrid for stochastic matrix eigenproblems'. Together they form a unique fingerprint.

Cite this