Tridiagonal matrices: Invertibility and conditioning
نویسندگان
چکیده
منابع مشابه
Tridiagonal Matrices and Boundary Conditions
We describe the spectra of certain tridiagonal matrices arising from differential equations commonly used for modeling flocking behavior. In particular we consider systems resulting from allowing an arbitrary boundary condition for the end of a one-dimensional flock. We apply our results to demonstrate how asymptotic stability for consensus and flocking systems depends on the imposed boundary c...
متن کاملInverse Tridiagonal Z – Matrices
In this paper, we consider matrices whose inverses are tridiagonal Z–matrices. Based on a characterization of symmetric tridiagonal matrices by Gantmacher and Krein, we show that a matrix is the inverse of a tridiagonal Z–matrix if and only if, up to a positive scaling of the rows, it is the Hadamard product of a so called weak type D matrix and a flipped weak type D matrix whose parameters sat...
متن کاملInvertibility of symmetric random matrices
We study n × n symmetric random matrices H, possibly discrete, with iid abovediagonal entries. We show that H is singular with probability at most exp(−nc), and ‖H−1‖ = O(√n). Furthermore, the spectrum of H is delocalized on the optimal scale o(n−1/2). These results improve upon a polynomial singularity bound due to Costello, Tao and Vu, and they generalize, up to constant factors, results of T...
متن کاملFull Sign-Invertibility and Symplectic Matrices
An n n sign pattern H is said to be sign-invertible if there exists a sign pattern H 1 (called the sign-inverse of H) such that, for all matrices A 2 Q(H), A 1 exists and A 1 2 Q(H 1). If, in addition, H 1 is sign-invertible (implying (H 1) 1 = H), H is said to be fully sign-invertible and (H;H 1) is called a sign-invertible pair. Given an n n sign pattern H, a Symplectic Pair in Q(H) is a pair...
متن کامل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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90273-d