Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
DOI10.1137/S1064827598338159zbMath0957.60076OpenAlexW2063333912MaRDI QIDQ4509795
Tuǧrul Dayar, William J. Stewart
Publication date: 19 October 2000
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827598338159
partitioningMarkov chainspreconditioningKrylov subspace methodsblock SORnear-complete decomposabilityiterative aggregation-disaggregation
Computational methods for sparse matrices (65F50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Acceleration of convergence in numerical analysis (65B99)
Related Items
Uses Software