| dc.contributor.author | Demanet, Laurent | |
| dc.contributor.author | Ying, Lexing | |
| dc.date.accessioned | 2013-05-02T20:16:44Z | |
| dc.date.available | 2013-05-02T20:16:44Z | |
| dc.date.issued | 2012-02 | |
| dc.date.submitted | 2011-04 | |
| dc.identifier.issn | 0025-5718 | |
| dc.identifier.issn | 1088-6842 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/78677 | |
| dc.description.abstract | This paper presents a numerical method for ``time upscaling'' wave equations, i.e., performing time steps not limited by the Courant-Friedrichs-Lewy (CFL) condition. The proposed method leverages recent work on fast algorithms for pseudodifferential and Fourier integral operators (FIO). This algorithmic approach is not asymptotic: it is shown how to construct an exact FIO propagator by 1) solving Hamilton-Jacobi equations for the phases, and 2) sampling rows and columns of low-rank matrices at random for the amplitudes. The setting of interest is that of scalar waves in two-dimensional smooth periodic media (of class C∞ over the torus), where the bandlimit $ N$ of the waves goes to infinity. In this setting, it is demonstrated that the algorithmic complexity for solving the wave equation to fixed time T ≃ 1 can be as low as O(N [superscript 2] log N) with controlled accuracy. Numerical experiments show that the time complexity can be lower than that of a spectral method in certain situations of physical interest. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | American Mathematical Society (AMS) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1090/S0025-5718-2012-02557-9 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Fast wave computation via Fourier integral operators | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Demanet, Laurent, and Lexing Ying. “Fast Wave Computation via Fourier Integral Operators.” Mathematics of Computation 81.279 (2012): 1455–1486. Web. 11 Apr. 2012. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.mitauthor | Demanet, Laurent | |
| dc.relation.journal | Mathematics of Computation | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Demanet, Laurent; Ying, Lexing | en |
| dc.identifier.orcid | https://orcid.org/0000-0001-7052-5097 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |