Abstract
In this paper we present three different pivoting strategies for solving general tridiagonal systems of linear equations. The first strategy resembles the classical method of Gaussian elimination with no pivoting and is stable provided a simple and easily checkable condition is met. In the second strategy, the growth of the elements is monitored so as to ensure backward stability in most cases. Finally, the third strategy also uses the right‐hand side vector to make pivoting decisions and is proved to be unconditionally backward stable.
Similar content being viewed by others
References
I. Bar-On, B. Codenotti and M. Leoncini, Checking robust non-singularity of a general tridiagonal matrix in linear time, BIT 36 (1996) 206–220.
I. Bar-On and M. Leoncini, Well-defined tridiagonal systems, Manuscript (April 1996).
I. Bar-On and M. Leoncini, Fast and reliable parallel solution of bidiagonal systems, Technical Report B4-96-08, Istituto di Matematica Computazionale del CNR Pisa (1996), submitted to Numer. Math.
I. Bar-On and M. Leoncini, Reliable sequential algorithms for solving bidiagonal systems of linear equations, Technical Report B4-96-04, Istituto di Matematica Computazionale del CNR, Pisa (1996), submitted to BIT with the title Reliable solution of bidiagonal systems with applications.
W.W. Barret, A theorem on inverses of tridiagonal matrices, Linear Algebra Appl. 27 (1979) 211–217.
A. Bjorck, Iterative refinement and reliable computing, in: Reliable Numerical Computation, eds. M.G. Cox and S.J. Hammarling (Oxford Univer. Press, Oxford, 1989).
C. de Boor and A. Pinkus, Backward error analysis for totally positive linear systems, Numer. Math. 27 (1977) 485–490.
J.R. Bunch, Partial pivoting strategies for symmetric matrices, Numer. Math. 11 (1974) 521–528.
T.F. Chan, On the existence and computation of LU-factorization with small pivots, Math. Comp. 42 (1985) 535–547.
A.M. Cohen, A note on pivot size in Gaussian elimination, Linear Algebra Appl. 8 (1974) 361–368.
C.W. Cryer, Pivot size in Gaussian elimination, Numer. Math. 12 (1968) 335–345.
C.W. Cryer, The LU-factorization of totally positive matrices, Linear Algebra Appl. 7 (1973) 83–92.
J. Demmel, The componentwise distance to the nearest singular matrix, SIAM J. Matrix Anal. Appl. 13 (1992) 10–19.
I. Dhillon, Reliable computation of the condition number of a tridiagonal matrix in O(n) time, SIAM J. Matrix Anal. Appl. (1998).
G.H. Golub and C.F. Van Loan, Matrix Computations (Johns Hopkins Univ. Press, Baltimore, MD, 1989).
M.D. Gunzburger and R.A. Nicolaides, Stability of Gaussian elimination without pivoting on tridiagonal Toeplitz matrices, Linear Algebra Appl. 45 (1982) 21–28.
W.J. Harrod, LU-decomposition of tridiagonal irreducible H matrices, SIAM J. Alg. Discrete Methods 7 (1986) 180–187.
D.J. Higham and N.J. Higham, Large growth factors in Gaussian elimination with pivoting, SIAM J. Matrix Anal. Appl. 10 (1989) 155–164.
N.J. Higham, Bounding the error in Gaussian elimination for tridiagonal systems, SIAM J. Matrix Anal. Appl. (1990) 521–530.
N.J. Higham, Algorithm 694: A collection of test matrices in MATLAB, ACM Trans. Math. Software 17 (1991) 289–305.
N.J. Higham, Accuracy and Stability of Numerical Algorithms (SIAM, Philadelphia, PA, 1995).
M. Jankowski and H. Wozniakowski, Iterative refinement implies numerical stability, BIT 17 (1977) 303–311.
C.L. Lawson and R.J. Hanson, Solving Least Squares Problems (Prentice-Hall, Englewood Cliffs, NJ, 1974).
G. Meurant, A review on the inverse of of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl. (1992) 707–728.
W. Oettli and W. Prager, Computability of approximate solution of linear equations with given error bounds for coefficients and right-hand sides, Numer. Math. 6 (1964) 405–409.
S. Poljak and J. Rohn, Checking robust nonsingularity is NP-hard, Math. Control Signals Systems 6 (1993) 1–9.
S.M. Rump, Bounds for the componentwise distance to the nearest singular matrix, SIAM J. Matrix Anal. Appl. 18 (1997) 83–103.
K. Sigmon, Matlab Primer 4e (CRC Press, Boca Raton, FL, 1994).
R.D. Skeel, Scaling for numerical stability in Gaussian elimination, J. Assoc. Comput. Mach. 26 (1979) 494–526.
R.D. Skeel, Iterative refinement implies numerical stability for Gaussian elimination, Math. Comp. 35 (1980) 817–832.
J.H. Wilkinson, Error analysis of direct method of matrix inversion, J. Assoc. Comput. Mach. 8 (1961) 281–330.
J.H. Wilkinson, The Algebraic Eigenvalue Problem (Oxford Univ. Press, Oxford, 1965), Reprinted in Oxford Science Publications (1988).
Rights and permissions
About this article
Cite this article
Bar‐On, I., Leoncini, M. Stable solution of tridiagonal systems. Numerical Algorithms 18, 361–388 (1998). https://doi.org/10.1023/A:1019137919461
Issue Date:
DOI: https://doi.org/10.1023/A:1019137919461