Block Householder transformation for parallel QR factorization
نویسندگان
چکیده
منابع مشابه
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 ...
متن کامل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 ...
متن کاملHouseholder QR Factorization With Randomization for Column Pivoting (HQRRP)
A fundamental problem when adding column pivoting to the Householder QR factorization is that only about half of the computation can be cast in terms of high performing matrixmatrix multiplications, which greatly limits the benefits that can be derived from so-called blocking of algorithms. This paper describes a technique for selecting groups of pivot vectors by means of randomized projections...
متن کاملAn Approach to Automatic Tuning for Parallel Householder QR Decomposition
We consider parallel computing of the Householder QR decomposition on SMP machines. This decomposition is one of the basic tools in matrix computations and is used in various problems such as the least square problem and the singular value decomposition of a rectangular matrix. Since this algorithm consists almost entirely of BLAS routines such as matrix-vector multiplications, the simplest way...
متن کاملParallel Tiled QR Factorization for Multicore Architectures
As multicore systems continue to gain ground in the high-performance computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine-grain parallelism becomes a major requirement and introduces the necessity of loose synchronization in the parallel execution of an ope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1999
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(99)00028-2