Computation of Pseudo-Differential Operators

Simple item page
dc.contributor.authorBao, Gangen_US
dc.contributor.authorSymes, William W.en_US
dc.date.accessioned2018-06-18T17:39:41Zen_US
dc.date.available2018-06-18T17:39:41Zen_US
dc.date.issued1992-11en_US
dc.date.noteNovember 1992en_US
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.en_US
dc.format.extent21 ppen_US
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>.en_US
dc.identifier.digitalTR92-34en_US
dc.identifier.urihttps://hdl.handle.net/1911/101774en_US
dc.language.isoengen_US
dc.titleComputation of Pseudo-Differential Operatorsen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
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
CMOR Technical Reports