Proceedings Paper
Fast Mapping Of Gravity Equations On A Linear Array| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper Abstract
Computing a gravity model on a sequential machine requires 0(N2) time, where N is the degree and order of the model. With the increasing demand for higher resolution gravity models, it will be necessary to develop more efficient techniques for performing the computations required by these models. In this paper, we describe a parallel mapping of a gravity model on a linear array. The mapping uses N +5 cells running in parallel to compute the gravity equations in 0(N) time. The mapping is the basis for an implementation on the Warp computer at Carnegie Mellon.
Paper Details
Date Published: 6 December 1989
PDF: 8 pages
Proc. SPIE 1154, Real-Time Signal Processing XII, (6 December 1989); doi: 10.1117/12.962377
Published in SPIE Proceedings Vol. 1154:
Real-Time Signal Processing XII
J. P. Letellier, Editor(s)
PDF: 8 pages
Proc. SPIE 1154, Real-Time Signal Processing XII, (6 December 1989); doi: 10.1117/12.962377
Show Author Affiliations
R. S. Baheti, GE Research and Development Center (United States)
V. J. Karkhanis, GE Aerospace (United States)
V. J. Karkhanis, GE Aerospace (United States)
D. R. O'Hallaron, GE Research and Development Center (United States)
M. Wilson, GE Aerospace (United States)
M. Wilson, GE Aerospace (United States)
Published in SPIE Proceedings Vol. 1154:
Real-Time Signal Processing XII
J. P. Letellier, Editor(s)
© SPIE. Terms of Use
