The Alternating Group Explicit (AGE) method on a transputer network
โ Scribed by D.J. Evans; S. Chikohora
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 409 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
โฆ Synopsis
Evans, D.J. and S. Chikokora, The alternating group explicit (AGE) method on a transputer network, Parallel Computing 17 (1991) 833-843.
In this paper, the implementation of the AGE iterative algorithm for the solution of 2-point boundary value problems on a transputer network is discussed.
๐ SIMILAR VOLUMES
This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni
In PM2 epeotroaoopy,'the usual method to Identify the proton or protone on a carbon bearing a hydroxyl group IS to ac'etylate or In general eeterlfy the hydroxyl group, when the proton(e) oonoerhed move6 downfield by abQUt 0.5 to 1.5 r unit6 (1). Horerdr, thle procedure may not alram be oonvenlent,