2012
DOI: 10.1137/100808174
|View full text |Cite
|
Sign up to set email alerts
|

Multiscale Discrete Approximation of Fourier Integral Operators

Abstract: We develop a discretization and computational procedures for approximation of the action of Fourier integral operators the canonical relations of which are graphs. Such operators appear, for instance, in the formulation of imaging and inverse scattering of seismic reflection data. Our discretization and algorithms are based on a multiscale low-rank expansion of the action of Fourier integral operators using the dyadic parabolic decomposition of phase space and on explicit constructions of low-rank separated re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
95
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 15 publications
(96 citation statements)
references
References 59 publications
1
95
0
Order By: Relevance
“…It is based on the discretization and approximation, to accuracy O(2 k/2 ), of the action ofF ij on a wave packet ' j,⌫,k (x), Expansion of the cutoff functions. To numerically evaluate (3.6) in reasonable time, we will use separated (in y andξ) representations ofǍ ij (y,ξ) andŠ ij (y,ξ) [2,10,11]. Such representations can be obtained by restricting the integration overξ to domains following a dyadic parabolic decomposition.…”
Section: Computationmentioning
confidence: 99%
See 4 more Smart Citations
“…It is based on the discretization and approximation, to accuracy O(2 k/2 ), of the action ofF ij on a wave packet ' j,⌫,k (x), Expansion of the cutoff functions. To numerically evaluate (3.6) in reasonable time, we will use separated (in y andξ) representations ofǍ ij (y,ξ) andŠ ij (y,ξ) [2,10,11]. Such representations can be obtained by restricting the integration overξ to domains following a dyadic parabolic decomposition.…”
Section: Computationmentioning
confidence: 99%
“…The number R of expansion terms is controlled by the prescribed accuracy ε of the tensor product representation. For a detailed description of the box-algorithm and its implementation, we refer to [2]. Based on this tensor product representation, it is possible to group computations and to evaluate the action ofF ij in Step 3 for all data wave packets of the same frequency box Bν ,k at once instead of for each ϕ γ individually.…”
Section: (R)mentioning
confidence: 99%
See 3 more Smart Citations