Tridiagonalization of Completely Nonnegative Matrices
نویسندگان
چکیده
منابع مشابه
Tridiagonalization of Completely Nonnegative Matrices
Let M = [ttUiSi /_i be completely nonnegative (CNN), i.e., every minor of Mis nonnegative. Two methods for reducing the eigenvalue problem for M to that of a CNN, tridiagonal matrix, T = [?,-,] (r,-,= 0 when |i — j\ > 1), are presented in this paper. In the particular case that M is nonsingular it is shown for one of the methods that there exists a CNN nonsingular 5 such that SM = TS.
متن کاملSeparating doubly nonnegative and completely positive matrices
The cone of Completely Positive (CP) matrices can be used to exactly formulate a variety of NP-Hard optimization problems. A tractable relaxation for CP matrices is provided by the cone of Doubly Nonnegative (DNN) matrices; that is, matrices that are both positive semidefinite and componentwise nonnegative. A natural problem in the optimization setting is then to separate a given DNN but non-CP...
متن کاملBlock Lanczos Tridiagonalization of Complex Symmetric Matrices
The classic Lanczos method is an effective method for tridiagonalizing real symmetric matrices. Its block algorithm can significantly improve performance by exploiting memory hierarchies. In this paper, we present a block Lanczos method for tridiagonalizing complex symmetric matrices. Also, we propose a novel componentwise technique for detecting the loss of orthogonality to stablize the block ...
متن کاملParallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for the block-tridiagonal divide-and-conquer algorithm for computing eigensystems and is useful for many algorithms desiring the efficiencies of block structure in matrices. For an “effectively” sparse matrix, which freq...
متن کاملNonnegative Matrices
For a loopless, acyclic, transitive directed graph S, we study the relations between the predecessor property and the well structured property on S. These properties assure the existence of nonnegativ€ Jordan bases for any nonnegative matrix with singular graph S.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1972
ISSN: 0025-5718
DOI: 10.2307/2004723