Parallel QR factorization by Householder and modified Gram-Schmidt algorithms (Q751755): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel QR factorization by Householder and modified Gram-Schmidt algorithms |
scientific article |
Statements
Parallel QR factorization by Householder and modified Gram-Schmidt algorithms (English)
0 references
1990
0 references
The paper proposes parallel implementations for the modified Gram-Schmidt and the Householder algorithms for computing the QR factorization of rectangular matrices on message passing systems in which the matrix is distributed by blocks of rows. It continues the paper by the first author and \textit{G. W. Stewart} [Linear Algebra Appl. 77, 275-299 (1986; Zbl 0587.65014)]. Experimental and simulation results validating the models of execution time are presented.
0 references
Gram-Schmidt algorithm
0 references
parallel implementations
0 references
Householder algorithms
0 references
QR factorization
0 references
rectangular matrices
0 references
message passing systems
0 references
