Computation of Pseudo-Differential Operators

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 pseudo-differential operator algebra. We show that the algorithm is efficient through analyzing its complexity. Some of numerical experiments are also presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1992
Accession Number
ADA455455

Entities

People

  • Gang Bao
  • William W. Symes

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Asymptotic Series
  • Computations
  • Fast Fourier Transforms
  • Information Operations
  • Mathematical Analysis
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Image Processing and Computer Vision.