论文信息 - Checking nonsingularity of tridiagonal matrices

Checking nonsingularity of tridiagonal matrices

I. Bar-On, B. Codenotti, and M. Leoncini presented a linear time algorithm for checking the nonsingularity of general tridiagonal matrices [BIT, 36:206, 1996]. A detailed implementation of their algorithm, with some extensions to possibly reducible matrices, is further described in the present paper.

Ilan Bar-On

[1] H. Eggleston,et al. Elements of the theory of functions , 1952 .

[2] Mauro Leoncini,et al. Reliable Solution of Tridiagonal Systems of Linear Equations , 2000, SIAM J. Numer. Anal..

[3] Ed Anderson,et al. LAPACK Users' Guide , 1995 .

[4] Svatopluk Poljak,et al. Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..

[5] M. Leoncini,et al. Reliable Solution of Bidiagonal Systems with Applications , 1999 .

[6] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .

[7] G.. Elements of the Theory of Functions , 1896, Nature.

[8] Charles L. Lawson,et al. Solving least squares problems , 1976, Classics in applied mathematics.