Parallel algorithm for householder transformation with applications to ill-conditioned problems
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
A parallel algorithm for Householder Transformation is given in this paper. Based on the parallelizing of Householder Transformation, we propose the algorithms for solving ill-conditioned matrix inversion, ill-conditioned linear system and ill-conditioned least squares. The proposed methods have acceptable execution time and the number of employed processors even in handling ill-conditioned problems.