Gravitational microlensing: A parallel, large-data implementation
β Scribed by Hugh Garsden; Geraint F. Lewis
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 517 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1384-1076
No coin nor oath required. For personal study only.
β¦ Synopsis
Gravitational lensing allows us to probe the structure of matter on a broad range of astronomical scales, and as light from a distant source traverses an intervening galaxy, compact matter such as planets, stars, and black holes act as individual lenses. The magnification from such microlensing results in rapid brightness fluctuations which reveal not only the properties of the lensing masses, but also the surface brightness distribution in the source. However, while the combination of deflections due to individual stars is linear, the resulting magnifications are highly non-linear, leading to significant computational challenges which currently limit the range of problems which can be tackled. This paper presents a new and novel implementation of a numerical approach to gravitational microlensing, increasing the scale of the problems that can be tackled by more than two orders of magnitude, opening up a new regime of astrophysically interesting problems.
π SIMILAR VOLUMES
Although logic languages, due to their nnn-declarative nature, are widely proclaimed to be conducive in theory to parallel implementation, in fact there appears to be insufficient practical evidence to stimulate further developments in this field. The paper puts forward various complications which a
## Abstract ## Purpose To exploit the capabilities of parallel processing in applying the spaceβtime adaptive processing (STAP) algorithm, previously explored on a small scale for functional magnetic resonance imaging (fMRI) applications, to conventional size fMRI data sets. ## Materials and Meth
Data-parallel languages allow programmers to easily express parallel computations by means of high-level constructs. To reduce overheads, the compiler partitions the computations among the processors at compile-time, on the basis of the static data distribution suggested by the programmer. When exec