Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix
- 1 January 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 7 (1) , 150-165
- https://doi.org/10.1137/0907011
Abstract
Let A be a tridiagonal matrix of order n. We show that it is possible to compute and hence condo (A), in O(n) operations. Several algorithms which perform this task are given and their numerical properties are investigated. If A is also positive definite then I[A-[[o can be computed as the norm of the solution to a positive definite tridiagonal linear system whose coeffcient matrix is closely related to A. We show how this computation can be carried out in parallel with the solution of a linear system Ax b. In particular we describe some simple modifications to the LINPACK routine SPTSL which enable this routine to compute condt (A), efficiently, in addition to solving Ax bKeywords
This publication has 10 references indexed in Scilit:
- Condition Number Estimation for Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1981
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- Inversion of band matricesLinear Algebra and its Applications, 1979
- On inverses of Hessenberg matricesLinear Algebra and its Applications, 1979
- Unrolling loops in fortranSoftware: Practice and Experience, 1979
- LINPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1979
- Backward error analysis for totally positive linear systemsNumerische Mathematik, 1976
- Methods of inverting tridiagonal matricesUSSR Computational Mathematics and Mathematical Physics, 1973
- Properties of Some Tridiagonal Matrices and Their Application to Boundary Value ProblemsSIAM Journal on Numerical Analysis, 1969
- Error Analysis of Direct Methods of Matrix InversionJournal of the ACM, 1961