Fast Mapping Of Gravity Equations On A Linear Array

R. S. Baheti; V. J. Karkhanis; D. R. O'Hallaron; M. Wilson

doi:10.1117/12.962377

6 December 1989 Fast Mapping Of Gravity Equations On A Linear Array

R. S. Baheti, V. J. Karkhanis, D. R. O'Hallaron, M. Wilson

Proceedings Volume 1154, Real-Time Signal Processing XII; (1989) https://doi.org/10.1117/12.962377
Event: 33rd Annual Technical Symposium, 1989, San Diego, United States

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.

Citation Download Citation

R. S. Baheti, V. J. Karkhanis, D. R. O'Hallaron, and M. Wilson "Fast Mapping Of Gravity Equations On A Linear Array", Proc. SPIE 1154, Real-Time Signal Processing XII, (6 December 1989); https://doi.org/10.1117/12.962377

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available