Affordable Access

Publisher Website

Modified Gram-Schmidt QR factorization on hypercube

Authors
Journal
Journal of Parallel and Distributed Computing
0743-7315
Publisher
Elsevier
Publication Date
Volume
12
Issue
1
Identifiers
DOI: 10.1016/0743-7315(91)90029-9
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract QR factorization is a popular calculation method in matrix algebra due to its usefulness in the solution of problems such as estimating least squares and calculating eigenvalues. In this paper, we describe a parallel algorithm for the calculation of the QR factorization on a hypercube architecture of the SIMD type with distributed memory. We have chosen the modified Gram-Schmidt method with pivoting to determine the QR factorization as it is characterized by good numerical stability. As an application of the QR factorization, we analyze the problem of least squares, developing a complementary parallel algorithm for solving it. Both algorithms are general; they are not limited by the size of the problem or the dimension of the hypercube. Finally, we analyze the algorithmic complexities of both parallel algorithms.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Modified Gram–Schmidt-based methods for block down...

on Journal of Computational and A... Jan 01, 2011

Ordered modified Gram-Schmidt orthogonalization re...

on Journal of Computational and A... Jan 01, 1995
More articles like this..