MARCA

swMATH547MaRDI QIDQ13302FDOQ13302

Author name not available (Why is that?)

Cited In (29)

• Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
• Specification techniques for Markov reward models
• Restricted additive Schwarz methods for Markov chains
• Title not available (Why is that?)
• Additive Schwarz Iterations for Markov Chains
• A numerical study of large sparse matrix exponentials arising in Markov chains.
• Inexact GMRES for singular linear systems
• Algorithms for an irreducible and lumpable strong stochastic bound
• Block SOR for Kronecker structured representations
• Efficient approximation of functions of some large matrices by partial fraction expansions
• Square and stretch multigrid for stochastic matrix eigenproblems
• Physiology and pathology of iterative aggregation–disaggregation methods
• Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
• Fast multilevel methods for Markov chains
• On the use of periodicity properties for the efficient numerical solution of certain Markov chains
• The cross-entropy method with patching for rare-event simulation of large Markov chains
• Convergence of multi-level iterative aggregation-disaggregation methods
• Title not available (Why is that?)
• A geometric view of Krylov subspace methods on singular systems.
• Aggregation/disaggregation iterative methods applied to Leontev systems and Markov chains.
• Alternating two-stage methods for consistent linear systems with applications to the parallel solution of Markov chains
• Allocation of buffer capacities in queueing networks with arbitrary topologies
• Algorithm 972
• Preconditioners based on strong subgraphs
• Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II: Fast convergence
• A parallel solver for large-scale Markov chains
• Approximating the large sparse matrix exponential using incomplete orthogonalization and Krylov subspaces of variable dimension
• Lumpable continuous-time stochastic automata networks.
• Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices

This page was built for software: MARCA