scispace - formally typeset
Open AccessJournal ArticleDOI

Computation of Pseudo-Differential Operators

Gang Bao, +1 more
- 01 Mar 1996 - 
- Vol. 17, Iss: 2, pp 416-429
Reads0
Chats0
TLDR
A simple algorithm is described for computing general pseudo-differential operator actions based on the asymptotic expansion of the symbol together with the fast Fourier transform, which shows that the algorithm is efficient through analyzing its complexity.
Abstract
A simple algorithm is described for computing general pseudo-differential operator actions. Our approach is based on the asymptotic expansion of the symbol together with the fast Fourier transform (FFT). The idea is motivated by the characterization of the pseudo-differential operator algebra. We show that the algorithm is efficient through analyzing its complexity. Some numerical experiments are also presented.

read more

Content maybe subject to copyright    Report






Citations
More filters
Journal ArticleDOI

A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators

TL;DR: This paper introduces a novel algorithm running in O(N^2 log N) time, i.e., with near-optimal computational complexity, and whose overall structure follows that of the butterfly algorithm.
Journal ArticleDOI

An approximate inverse to the extended Born modeling operator

TL;DR: In this paper, the authors modified RTM in the subsurface offset domain to create an asymptotic (high-frequency) approximation to extended Born inversion operator.
Journal ArticleDOI

Fast Computation of Fourier Integral Operators

TL;DR: In this paper, a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation, general hyperbolic equations, and curvilinear tomography is introduced.
Posted Content

Fast Computation of Fourier Integral Operators

TL;DR: A new numerical algorithm which requires O(N^{2.5} \log N) operations and as low as $O(\sqrt{N})$ in storage space (the constants in front of these estimates are small).
Journal ArticleDOI

Accelerating extended least-squares migration with weighted conjugate gradient iteration

TL;DR: In this article, the convergence of extended least-squares migration is accelerated by combining the conjugate gradient algorithm with weighted norms in range (data) and domain (model) spaces that render the extended Born modeling operator approximately unitary.
References
More filters
Book

Computational Frameworks for the Fast Fourier Transform

TL;DR: The Radix-2 Frameworks, a collection of general and high performance FFTs designed to solve the multi-Dimensional FFT problem of Prime Factor and Convolution, are presented.
Related Papers (5)