Parallel QR processing of Generalized Sylvester matrices

In this paper, we develop a parallel QR factorization for the generalized Sylvester matrix. We also propose a significant faster evaluation of the QR applied to a modified version of the initial matrix. This decomposition reveals useful information such as the rank of the matrix and the greatest com...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2011-04, Vol.412 (16), p.1484-1491
Main Authors: Kourniotis, M., Mitrouli, M., Triantafyllou, D.
Format: Article
Language:English
Subjects:
Algorithms
Computer simulation
Decomposition
Factorization
Generalized Sylvester
Mathematical analysis
Mathematical models
Matrices
Matrix methods
Numerical methods
Parallel QR factorization
Rank
ScaLapack
Serials
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we develop a parallel QR factorization for the generalized Sylvester matrix. We also propose a significant faster evaluation of the QR applied to a modified version of the initial matrix. This decomposition reveals useful information such as the rank of the matrix and the greatest common divisor of the polynomials formed from its coefficients. We explicitly demonstrate the parallel implementation of the proposed methods and compare them with the serial ones. Numerical experiments are also presented showing the speed of the parallel algorithms.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.11.051