𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Gram-Schmidt orthonormalisation on parallel computers

✍ Scribed by Lingen, F. J.

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
110 KB
Volume
16
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

✦ Synopsis

This paper compares the parallel e ciency of three Gram-Schmidt orthonormalization algorithms: modiΓΏed Gram-Schmidt, classical Gram-Schmidt, and iterated classical Gram-Schmidt. The paper shows how these algorithms can be implemented on a parallel computer, and how their communication overhead can be minimized. In addition, it brie y examines the numerical properties of these algorithms. Finally, it provides some guidelines for selecting the most appropriate algorithm.

πŸ“œ SIMILAR VOLUMES

Parallel Gram-Schmidt orthogonalisation
Parallel Gram-Schmidt orthogonalisation on a network of transputers
✍ L.C. Waring; M. Clint πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 288 KB

Waring, L.C. and M. Clint, Parallel Gram-Schmidt orthogonalisation on a network of transputers, Parallel Computing 17 (1991) 1043-1050\_ A parallel algorithm to perform modified Gram-Schmidt orthogonalisation of a set of vectors using an MIMD architecture is described. An array of transputers confi

A New Efficient Algorithm for Computatio
A New Efficient Algorithm for Computational Aeroacoustics on Parallel Processors
✍ Yusuf Γ–zyΓΆrΓΌk; Lyle N. Long πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 922 KB

conditions. These conditions, which represent additional time-dependent partial differential equations, are ex-One of the great challenges in computational physics is the prediction of flow associated noise, where the quantities of interest, tremely important for successful aeroacoustic simulations.