Computing the condition number of tridiagonal and diagonal-plus- semiseparable matrices in linear time

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 3, 2005, Pages 801-820

  Hargreaves, Gareth I ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Condition number; Diagonal plus semiseparable matrix; QR factorization; Tridlagonal matrix

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; MATHEMATICAL TECHNIQUES; VELOCITY MEASUREMENT;

CONDITION NUMBER; DIAGONAL-PLUS-SEMISEPARABLE MATRIX; QR FACTORIZATION; TRIDLAGONAL MATRIX;

MATRIX ALGEBRA;

EID: 33746281706     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/040606636     Document Type: Article

References (19)

1. E. ANDERSON. Z. BAI, C. BISCHOF, S. BLACKFORD, J. DEMMEL. J. DONGARRA, J. D. CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNKY, AND D. SORENSEN, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, PA, 1999.
2. M. VAN BAREL, E. VAN CAMP, AND N. MASTRONARDI, Two fast algorithms for solving diagonal-plus-semiseparable linear systems, J. Comput. Appl. Math., 164-168 (2004), pp. 731-747.
3. M. VAN BAREL, L. G. D. FASINO, AND N. MASTRONARDI, Orthogonal rational functions and structured matrices, SIAM J. Matrix Anal. Appl., 26 (2004), pp. 810-829.
4. M. VAN BAREL, R. VANDEBRIL, AND N. MASTRONARDI, An orthogonal similarity reduction of a matrix into semiseparable form, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 176-197.
5. D. A. BINI, L. GEMIGNANI, AND F. TISSEUR, The Ehrlieh-Aberth method for the nonsymmetric tridiagonal eigenvalue problem, SIAM J. Matrix Anal. Appl., 27 (2006), pp. 163-175.
6. S. CHANDRASEKARAN AND M. GU, Fast and stable algorithms for banded plus semiseparable matrices, SIAM J. Matrix Anal. Appl., 25 (2003), pp. 373-384.
7. I. DHILLON, Reliable computation of the condition number of a tridiagonal matrix in O(n) time, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 776-796.
8. Y. EIDELMAN AND I. GOHBERG, A modification of the Dewilde-van der Veen method for inversion af finite structured matrices, Linear Algebra Appl., 343-344 (2001), pp. 419-450.
9. P. E. GILL, G. H. GOLUB, W. MURRAY, AND M. A. SAUNDERS, Methods for modifying matrix factorizations, Math. Comp., 28 (1974), pp. 506-535.
10. L. GREENGARD AND V. ROKHLIN, On the solution of two-point boundary value problems, Comm. Pure Appl. Math., 44 (1991), pp. 419-452.
11. D. J. HIGHAM, Condition numbers and their condition numbers, Linear Algebra Appl., 214 (1995), pp. 193-213.
12. N.J. HIGHAM, Efficient algorithms for computing the condition number of a tridiagonal matrix, SLAM J. Sci. Statist. Comput., 7 (1986), pp. 150-166.
13. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, PA, 2002.
14. IEEE Standard for Binary Floating Point Arithmetic, Technical Report Std. 754-1986, IEEE/ANSI, New York, 1985.
15. S.-Y. KANG, I. KOLTRACHT, AND R. RAWITSCHER, Nyström-Clenshaw-Curtis quadrature for integral equations with discontinuous kernels, Math. Comp., 72 (2003), pp. 729-756.
16. J. LEE AND L. GREENGARD, A fast adaptive numerical method for stiff two-point boundary value problems, SIAM J. Sci. Comput., 18 (1997), pp. 403-429.
17. N. MASTRONARDI, S. CHANDRASEKARAN, AND S. VAN HUFFEL, Fast and stable two-way algorithm for diagonal plus semi-separable systems of linear equations, Numer. Linear Algebra Appl., 8 (2001), pp. 7-12.
18. H. P. STARR, On the Numerical Solution of One-Dimensional Integral and Differential Equations, Ph.D. theeis, Yale University, New Haven, CT, 1991.
19. G. W. STEWART, Introduction to Matrix Computations, Academic Press, New York, 1973.