Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
نویسندگان
چکیده
منابع مشابه
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
For a sparse symmetric matrix, there has been much attention given to algorithms for reducing the bandwidth. As far as we can see, little has been done for the unsymmetric matrix A, which has distinct lower and upper bandwidths l and u. When Gaussian elmination with row interchanges is applied, the lower bandwidth is unaltered while the upper bandwidth becomes l+u. With column interchanges, the...
متن کاملReducing the bandwidth of a sparse matrix with tabu search
The bandwidth of a matrix { } ij a A = is defined as the maximum absolute difference between i and j for which 0 ≠ ij a . The problem of reducing the bandwidth of a matrix consists of finding a permutation of the rows and columns that keeps the nonzero elements in a band that is as close as possible to the main diagonal of the matrix. This NP-complete problem can also be formulated as a labelin...
متن کاملAn Approach for Parallelizing any General Unsymmetric Sparse Matrix Algorithm
In many large scale scientiic and engineering computations, the solution to a sparse linear system is required. We present a partial unsymmetric nested dissection method that can be used to parallelize any general unsymmetric sparse matrix algorithm whose pivot search can be restricted to a subset of rows and columns in the active submatrix. The submatrix is determined by the partial unsymmetri...
متن کاملApplying Schur Complements for Handling General Updates of a Large, Sparse, Unsymmetric Matrix
We describe a set of procedures for computing and updating an inverse representation of a large and sparse unsymmetric matrix A. The representation is built of two matrices: an easily invertible, large and sparse matrix A0 and a dense Schur complement matrix S. An e cient heuristic is given that nds this representation for any matrix A and keeps the size of S as small as possible. Equations wit...
متن کاملSparse coding of total variability matrix
In text-independent speaker verification, it has been shown effective to represent the variable-length and information rich speech utterances using fixed-dimensional vectors, for instance, in the form of i-vectors. An i-vector is a low-dimensional vector in the so-called total variability space represented with a thin and tall rectangular matrix. Taking each row of the total variability matrix ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2006
ISSN: 0895-4798,1095-7162
DOI: 10.1137/050629938