Fast Computation of Fourier Integral Operators

DOI10.1137/060671139zbMath1157.65522arXivmath/0610051OpenAlexW2063399239MaRDI QIDQ3545254

Lexing Ying, Laurent Demanet, Emmanuel J. Candès

Publication date: 10 December 2008

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0610051

zbMATH Keywords

computational complexity wave propagation numerical examples randomized algorithms Fourier integral operators generalized Radon transform oscillatory integrals nonuniform fast Fourier transform separated representation matrix approximation reflection seismology operator compression curvilinear tomography

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Seismology (including tsunami modeling), earthquakes (86A15) Radon transform (44A12) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items (29)

Deep learning for inverse problems. Abstracts from the workshop held March 7--13, 2021 (hybrid meeting) ⋮ Fast wave computation via Fourier integral operators ⋮ Approximate inversion of discrete Fourier integral operators ⋮ An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments ⋮ Optimization Methods for Synthetic Aperture Radar Imaging ⋮ Synthetic Aperture Inversion for Statistically Nonstationary Target and Clutter Scenes ⋮ Fast algorithms for the multi-dimensional Jacobi polynomial transform ⋮ On the approximation of functions by tanh neural networks ⋮ Quasi-Banach algebras and Wiener properties for pseudodifferential and generalized metaplectic operators ⋮ Computing Fourier integral operators with caustics ⋮ Extraction of Digital Wavefront Sets Using Applied Harmonic Analysis and Deep Neural Networks ⋮ Resolution analysis of inverting the generalized $N$-dimensional Radon transform in $\mathbb{R}^n$ from discrete data ⋮ Resolution Analysis of Inverting the Generalized Radon Transform from Discrete Data in $\mathbb{R}^3$ ⋮ Regularity and multi-scale discretization of the solution construction of hyperbolic evolution equations with limited smoothness ⋮ A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? ⋮ Simultaneous approximation of a smooth function and its derivatives by deep neural networks with piecewise-polynomial activations ⋮ Multidimensional butterfly factorization ⋮ Fast Multiscale Gaussian Beam Method for Three-Dimensional Elastic Wave Equations in Bounded Domains ⋮ Butterfly-Net: Optimal Function Representation Based on Convolutional Neural Networks ⋮ Interpolative Butterfly Factorization ⋮ Nonlinear approximation of functions in two dimensions by sums of wave packets ⋮ Wave Phenomena ⋮ Sparsity of Gabor representation of Schrödinger propagators ⋮ Krylov subspace spectral methods for the time-dependent Schrödinger equation with non-smooth potentials ⋮ Solving inverse problems using data-driven models ⋮ A randomized method for one‐step extrapolation in reverse time migration ⋮ A Multiscale Butterfly Algorithm for Multidimensional Fourier Integral Operators ⋮ How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix? ⋮ Efficient representation and accurate evaluation of oscillatory integrals and functions

This page was built for publication: Fast Computation of Fourier Integral Operators