Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix
From MaRDI portal
Publication:3734977
DOI10.1137/0907011zbMath0599.65026WikidataQ56999086 ScholiaQ56999086MaRDI QIDQ3734977
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
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Backward Error Analysis of Cyclic Reduction for the Solution of Tridiagonal Systems, Tridiagonal splittings in the conditioning and parallel solution of banded linear systems, The use of the factorization of five-diagonal matrices by tridiagonal Toeplitz matrices, Tridiagonal matrices: Invertibility and conditioning, Upper bound of the condition number in spectral norm of tridiagonal matrices, Bounds for the solutions of a class of tridiagonal linear systems, Fernando's solution to Wilkinson's problem: An application of double factorization