Show simple item record

dc.contributor.authorHu, Jingwei
dc.contributor.authorFomel, Sergey
dc.contributor.authorDemanet, Laurent
dc.contributor.authorYing, Lexing
dc.contributor.otherMassachusetts Institute of Technology. Earth Resources Laboratory
dc.date.accessioned2014-09-30T14:17:08Z
dc.date.available2014-09-30T14:17:08Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/1721.1/90469
dc.description.abstractWe introduce a fast butterfly algorithm for the hyperbolic Radon transform commonly used in seismic data processing. For two-dimensional data, the algorithm runs in complexity O(N[superscript 2] logN), where N is representative of the number of points in either dimension of data space or model space. Using a series of examples, we show that the proposed algorithm is significantly more efficient than conventional integration.en_US
dc.language.isoen_USen_US
dc.publisherMassachusetts Institute of Technology. Earth Resources Laboratoryen_US
dc.relation.ispartofseriesEarth Resources Laboratory Industry Consortia Annual Report;2012-20
dc.subjectNumerical methods
dc.titleA fast butterfly algorithm for the hyperbolic Radon transformen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record