Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix

DOI10.1137/0907011zbMath0599.65026OpenAlexW2073943554WikidataQ56999086 ScholiaQ56999086MaRDI QIDQ3734977

Nicholas J. Higham

Publication date: 1986

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: http://eprints.maths.manchester.ac.uk/693/1/high86t.pdf

zbMATH Keywords

tridiagonal matricespositive definite matrixmatrix condition numberLINPACK

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Bounds for the solutions of a class of tridiagonal linear systems ⋮ On the comparison of H-matrices with M-matrices ⋮ On modeling hydraulic fracture in proper variables: stiffness, accuracy, sensitivity ⋮ Fernando's solution to Wilkinson's problem: An application of double factorization ⋮ The use of the factorization of five-diagonal matrices by tridiagonal Toeplitz matrices ⋮ Fast block diagonalization of \(k\)-tridiagonal matrices ⋮ Bounds for the condition number of a class of tridiagonal and block tridiagonal matrices ⋮ Tridiagonal matrices: Invertibility and conditioning ⋮ Upper bound of the condition number in spectral norm of tridiagonal matrices ⋮ Backward Error Analysis of Cyclic Reduction for the Solution of Tridiagonal Systems ⋮ Tridiagonal splittings in the conditioning and parallel solution of banded linear systems ⋮ Estimating the extremal eigenvalues of a symmetric matrix ⋮ Error Bounds for Linear Recurrence Relations