Abstract
The problem of solving large M-matrix linear systems with sparse coefficient matrix in block Hessenberg form is here addressed. In previous work of the authors a divide-and-conquer strategy was proposed and a backward error analysis of the resulting algorithm was presented showing its effectiveness for the solution of computational problems of queueing theory and Markov chains. In particular, it was shown that for block Hessenberg M-matrices the algorithm is weakly backward stable in the sense that the computed solution is the exact solution of a nearby linear system, where the norm of the perturbation is proportional to the condition number of the coefficient matrix. In this note a better error estimate is given by showing that for block Hessenberg M-matrices the algorithm is even backward stable.
Similar content being viewed by others
References
A. Berman and R. Plemmons, Nonnegative Matrices in the Mathematical Sciences (Academic Press, New York, 1979).
J.P.C. Blanc, A numerical approach to cyclic-service queueing models, Queueing Systems 6 (1990) 173–188.
J.W. Demmel, N.J. Higham and R.S. Schreiber, Block LU factorization, Numer. Linear Algebra Appl. 2(2) (1995) 173–190.
P. Favati, G. Lotti and O. Menchi, Efficient solution of M-matrix linear systems of band block Hessenberg form, submitted for publication.
P. Favati, G. Lotti, O. Menchi and F. Romani, Efficient solution of sparse block Hessenberg systems, Acta Tecnica Acad. Sci. Hung. 108 (1997–1999) 89–105.
L. Gemignani and G. Lotti, Efficient and stable solution of M-matrix linear systems of (block) Hessenberg form, SIAM J. Matrix Anal. Appl. 24 (2003) 852–876.
N.J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed. (SIAM, Philadelphia, PA, 2002).
M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Dekker, New York, 1989).
G.W. Stewart, On the solution of block Hessenberg systems, Numer. Linear Algebra Appl. 2 (1995) 287–296.
G.W. Stewart, Implementing an algorithm for solving block Hessenberg systems, Technical Report CS-TR-3295, Department of Computer Science, University of Maryland, College Park (1993).
W.J. Stewart, Introduction to the Numerical Solution of Markov Chains (Princeton Univ. Press, Princeton, NJ, 1994).
U. Von Matt and G.W. Stewart, Rounding errors in solving block Hessenberg systems, Math. Comp. 65(213) (1996) 115–135.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gemignani, L., Lotti, G. Rounding Error Analysis in Solving M-Matrix Linear Systems of Block Hessenberg Form. Numerical Algorithms 36, 157–168 (2004). https://doi.org/10.1023/B:NUMA.0000033130.75020.0e
Issue Date:
DOI: https://doi.org/10.1023/B:NUMA.0000033130.75020.0e