𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer

✍ Scribed by Eric Goles; Marcos Kiwi


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
483 KB
Volume
18
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The solution of linear equations on a SI
✍ S.J. Webb; J.J. McKeown; D.J. Hunt πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 392 KB

Techniques for solving linear equations on a single instruction multiple data (SIMD) computer such as the ICL DAP have so far been confined to simple methods such as the Successive Overrelaxation and Alternating Direction Implicit algorithms. While these techniques are adequate for simple finite dif