The generalized householder transformation and sparse matrices
نویسندگان
چکیده
منابع مشابه
Lazy Householder Decomposition of Sparse Matrices
This paper describes Householder reduction of a rectangular sparse matrix to small band upper triangular form Bk+1. Bk+1 is upper triangular with nonzero entries only on the diagonal and on the nearest k superdiagonals. The algorithm is similar to the Householder reduction used as part of the standard dense SVD computation. For the sparse “lazy” algorithm, matrix updates are deferred until a ro...
متن کاملUBk+1V Block Sparse Householder Decomposition
This paper describes Householder reduction of a rectangular sparse matrix to small band upper triangular form. Using block Householder transformations gives good orthogonality, is computationally efficient, and has good potential for parallelization. The algorithm is similar to the standard dense Householder reduction used as part of the usual dense SVD computation. For the sparse algorithm, th...
متن کاملSparse Householder QR Factorization on a MeshRam
In this document we are going to analyze the pa-rallelization of QR factorization by means of House-holder transformations. This parallelization will be carried out on a machine with a mesh topology (a 2-D torus to be more precise). We use a cyclic distribution of the elements of the sparse matrix M we want to decompose over the processors. Each processor represents the nonzero elements of its ...
متن کاملSparse Householder QR Factorization on a Mesh
In this document we are going to analyze the pa-rallelization of QR factorization by means of House-holder transformations. This parallelization will be carried out on a machine with a mesh topology (a 2-D torus to be more precise). We use a cyclic distribution of the elements of the sparse matrix M we want to decompose over the processors. Each processor represents the nonzero elements of its ...
متن کاملConstrained adaptation algorithms employing Householder transformation
This paper presents a tutorial-like detailed explanation of linearly constrained minimum-variance filtering in order to introduce an efficient implementation that utilizes Householder transformation (HT). Through a graphical description of the algorithms, further insight on linearly constrained adaptive filters was made possible, and the main differences among several algorithms were highlighte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90314-4