One way, how to speed up the computation of the singular value decomposition of a given matrix A 2 C mÂn ; m P n, by the parallel two-sided block-Jacobi method, consists of applying some pre-processing steps that would concentrate the Frobenius norm near the diagonal. Such a concentration should hop
✦ LIBER ✦
On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm
✍ Scribed by Martin Bečka; Gabriel Okša; Marián Vajteršic; Laura Grigori
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 216 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Efficient pre-processing in the parallel
✍
Gabriel Okša; Marián Vajteršic
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 272 KB
On variable blocking factor in a paralle
✍
Martin Bečka; Gabriel Okša
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 225 KB
The parallel two-sided block-Jacobi singular value decomposition (SVD) algorithm with dynamic ordering, originally proposed in [Parallel Comput. 28 (2002) 243-262], has been extended with respect to the blocking factor '. Unlike the unique blocking factor ' ¼ 2p in the original algorithm running on
On the QR algorithm and updating the SVD
✍
Marc Moonen; Paul Van Dooren; Filiep Vanpoucke
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 969 KB