Orthogonal reduction of dense matrices to bidiagonal form on computers with distributed memory architectures
In this paper, we describe a parallel implementation for the blocked reduction of dense matrices to bidiagonal form by Householder transformations. The method is based on the idea of using un-normed reflector vector. Results from experiments on the Intel Paragon are given. Comparison between the Sca...
Uloženo v:
| Vydáno v: | Parallel computing Ročník 24; číslo 2; s. 305 - 313 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.02.1998
|
| Témata: | |
| ISSN: | 0167-8191, 1872-7336 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In this paper, we describe a parallel implementation for the blocked reduction of dense matrices to bidiagonal form by Householder transformations. The method is based on the idea of using un-normed reflector vector. Results from experiments on the Intel Paragon are given. Comparison between the ScaLapack bidiagonalization and the method proposed is provided. |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0167-8191 1872-7336 |
| DOI: | 10.1016/S0167-8191(98)00008-8 |