Alternating two-stage methods for consistent linear systems with applications to the parallel solution of Markov chains

Authors:
Héctor Migallón;Violeta Migallón;Jose Penadés
Affiliations:
Departamento de Fısica y Arquitectura de Computadores, Universidad Miguel Hernández, E-03202 Elche, Alicante, Spain;Departamento de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, E-03071 Alicante, Spain;Departamento de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, E-03071 Alicante, Spain
Venue:
Advances in Engineering Software
Year:
2010

Citing 6
Cited 1

Numerical methods in Markov chain modeling

Operations Research
Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
Convergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices

Mathematics of Computation
Iterative solution of nonlinear equations in several variables

Iterative solution of nonlinear equations in several variables
Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains

SIAM Journal on Scientific Computing
Application of Threshold Partitioning of Sparse Matrices to Markov Chains

IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)

Location Prediction Based on a Sector Snapshot for Location-Based Services

Journal of Network and Systems Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two-stage methods in which the inner iterations are accomplished by an alternating method are developed. Convergence of these methods is shown in the context of solving singular and nonsingular linear systems. These methods are suitable for parallel computation. Experiments related to finding stationary probability distribution of Markov chains are performed. These experiments demonstrate that the parallel implementation of these methods can solve singular systems of linear equations in substantially less time than the sequential counterparts.