Computation of Pseudo-Differential Operators

Simple item page
dc.contributor.authorBao, Gang
dc.contributor.authorSymes, William W.
dc.date.accessioned2018-06-18T17:39:41Z
dc.date.available2018-06-18T17:39:41Z
dc.date.issued1992-11
dc.date.noteNovember 1992
dc.description.abstractA 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 numerical experiments are also presented.
dc.format.extent21 pp
dc.identifier.citationBao, Gang and Symes, William W.. "Computation of Pseudo-Differential Operators." (1992) <a href="https://hdl.handle.net/1911/101774">https://hdl.handle.net/1911/101774</a>.
dc.identifier.digitalTR92-34
dc.identifier.urihttps://hdl.handle.net/1911/101774
dc.language.isoeng
dc.titleComputation of Pseudo-Differential Operators
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR92-34.pdf
Size:
472.97 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports