|Title:|| CHECKING ROBUST NON-SINGULARITY OF A
GENERAL TRIDIAGONAL MATRIX IN LINEAR TIME.
|Authors:|| I. Bar-On, B. Codenotti and M. Leoncini
|Abstract:||We present in this paper a linear time algorithm for checking whether a general tridiagonal matrix could become singular under possible perturbations of its coefficients. We further present perturbation bounds for the solutions to some related tridiagonal systems.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1995/CS/CS0858), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1995
To the main CS technical reports page
Computer science department, Technion