Use the time-harmonic wave convention , with a positive background wavenumber . The scalar Helmholtz equation for a constant-density acoustic model isWriting gives the exact envelope equationThe paraxial approximation neglects relative to , giving the parabolic wave equationThe choice of carrier and the direction of propagation matter: this is a forward, slowly varying envelope approximation. Sufficient scale conditions are , transverse spectral components , and medium/envelope variation on longitudinal scales large compared with . With the carrier fixed at the background , small makes the refractive phase vary slowly too. Large-angle propagation, appreciable backscattering, or rapid longitudinal variation violates the approximation. Acoustic models with variable mass density can have additional gradient terms, so the scalar Helmholtz equation itself is a model assumption. For the Gaussian beam in part (b), useful initial conditions are and , with the second condition absent for an initially uncurved beam. A narrow angular spectrum, rather than merely the label “Gaussian”, justifies the paraxial approximation.
PutIn free space, the parabolic wave equation is . Under the Fourier transform convention , it becomesThe Gaussian integral is legitimate because . Invert the transform after multiplying by . A second Gaussian integral, or equivalently one-dimensional transverse Fresnel propagation, givesChoose the square-root branch continuously from ; for real there is no zero of . This gives the correct incident field at , and direct differentiation verifies the free parabolic wave equation.
For clarity, the squared envelope magnitude isThe Gaussian beam with one transverse coordinate remains Gaussian, with one-transverse-coordinate amplitude factor , not the of a beam with two transverse coordinates. The negative initial quadratic phase produces focusing for ; diffraction prevents a singularity at . These expressions describe the paraxial approximation to free propagation, rather than an exact unrestricted Helmholtz equation beam.
No: the first moment generally depends on the transverse coordinate. At entry to the random medium, the initial data are deterministic, sowhich is a nonconstant Gaussian beam profile. Statistical homogeneity of the medium says that shifting both the medium and the incident data gives correspondingly shifted field statistics. It does not make the response to fixed, localized incident data translation invariant.
In particular, Gaussian coherent-field propagation in the Markov approximation, derived in part (d), givesfor the linear weak-index model. A homogeneous attenuation factor multiplies the varying beam profile. Thus spatially homogeneous medium statistics can coexist with a transversely inhomogeneous coherent field. The first moment is not the mean wave intensity, and disappearance of the coherent component is not itself disappearance of the total wave energy.
Write and . Substituting into part (a), without prematurely replacing by its linear part, givesTaking the expectation yields the exact mean equation within the paraxial approximation:The correlation term cannot be discarded just because : the field depends on the same random medium as . Nor can be factored exactly from the given variance alone. The printed statistics do not specify the autocorrelation function of a random field, so they do not determine a unique local closed equation for .
A useful covariance-dependent equation follows to second order in . Defineand letbe the Fresnel propagator kernel for one transverse coordinate. The Duhamel principle applied to the linear fluctuation term giveswhere . Multiply by and average. Also . Since , replacing by in terms already multiplied by preserves second-order accuracy. We obtain the weak-fluctuation memory equation for the coherent fieldThis perturbation statement is for fixed propagation intervals with sufficient covariance regularity and moment bounds. The kernel is understood as an oscillatory integral. If the field is jointly Gaussian, odd perturbative contributions vanish and the remainder can be improved under the corresponding expansion hypotheses. Joint Gaussianity itself still leaves the covariance unspecified. The term is the quadratic refractive-index shift in the coherent field; it comes from the mean of .
For the usual local answer, impose the additional Markov approximation for a random medium. Its longitudinal correlation length must be much shorter than the distance on which the envelope varies, and diffraction across that correlation distance must not resolve substantial transverse covariance variation. Away from the entry layer, replace the slowly varying factors in the memory integral by their local values and extend the longitudinal integral to infinity. Define the integrated covarianceFor an integrable real stationary covariance, is even, and is its zero-longitudinal-frequency spectral density. The conventional leading weak-index model keeps only the linear random potential ; in that model the local first-moment equation isThe factor can be checked independently in the white-noise model. If is a Brownian field with , writeConverting the Stratonovich integral to an Itô integral adds . The remaining stochastic integral has zero mean, giving the boxed equation andIf the finite-correlation model retains consistently through order , the local second-order expansion also has , adding the phase factor . This phase is computed before the white-noise idealization: squaring ideal Gaussian white noise is not the finite-variance operation .
The need for a correlation assumption can be seen without any closure argument. The stationary Gaussian random field , with a single standard normal variable , has all the printed one-point statistics. In the linear weak-index model it givesIts attenuation is quadratic in propagation distance, whereas the Markov model gives linear-distance exponential attenuation. The local attenuation equation requires the additional correlation/Markov assumption; it does not follow from statistical homogeneity and unit variance alone.
Take the same convention and an outgoing field. Define the scattering potential with the positive-contrast sign,The outgoing Green function for the three-dimensional Helmholtz equation isThus the Lippmann-Schwinger equation has a plus sign:Replacing the total field inside the integral by the incident field gives the Born approximation for scalar wave scatteringMore generally, iterating the integral equation gives the Born series ; its first term is the boxed expression. A sufficient convergence condition is on the chosen space of fields in , and accurate single-scattering truncation needs the neglected terms to be small. Weak refractive contrast is useful, but for a sufficiently large or resonant scatterer it is not by itself a guarantee of negligible multiple scattering.
For with the observation distance much larger than the scatterer, expand . The far-field pattern in the Born approximation for scalar wave scattering is consequentlyThis convention includes the factor in ; moving that factor into the outgoing-wave definition would change the pattern's normalization.
The absolute energy flux depends on what physical amplitude represents. For acoustic pressure in a homogeneous fluid of mass density and wave speed , the momentum equation gives the particle-velocity amplitude . The time average of harmonic power and acoustic intensity then giveThe radial derivative of the outgoing factor is . Its imaginary current is therefore to leading order. The incident unit-amplitude plane wave has imaginary current . Hence, with ,The scattered energy flux points along at leading order, and the incident energy flux along . If is a velocity-potential amplitude instead, both leading expressions use the common prefactor in place of . A normalized scalar current uses as the common prefactor. The paper does not specify this amplitude normalization; the ratio in part (c) is independent of that choice.
Use the same physical normalization for both fields. Part (b) has , so the common energy flux prefactor cancels. The differential cross-section for scalar wave scattering isThe far-field pattern has dimensions of length in this normalization, so the differential cross-section for scalar wave scattering has dimensions of area per unit solid angle. Only the scattered field is used in this ratio; interference between the incident and scattered fields is a different contribution to the total field's energy flux.
Let the medium's autocorrelation function of a random field and power spectrum use the explicit conventionSince , only the linear term in is needed to obtain the cross-section through second order:Squaring and taking the expectation givesThis is the finite-volume formula in the Born approximation for scalar wave scattering; the zero mean of does not make its squared scattered amplitude vanish. For a jointly centered Gaussian random field, the third-order contribution is zero, so the next perturbative contribution is fourth order when that expansion is valid.
Introduce the overlap volume . Changing variables rewrites the double integral asWhen the linear dimensions of a regular scattering volume are large compared with the correlation length, and is integrable, over the significant covariance range. This gives the finite-volume random scattering spectrum resultThere are two distinct approximations here: the weak-scattering expansion in and the negligible-boundary-overlap approximation in the volume-to-correlation-scale ratio. If instead denotes the power spectrum of the index fluctuation , then and the external factor is absorbed into .
Statistical homogeneity alone allows an anisotropic spectrum, so its argument is generally the vector . If statistical isotropy is additionally assumed, depends only onThe scalar notation is valid in that isotropic case. For the alternative convention , the bulk formula is . Changing the sign of the scattering vector does not change the spectrum of a real stationary scalar field; changing the Fourier transform normalization does change the displayed factors. Both conventions have therefore been stated explicitly.
For noisy data, exact equality may be impossible: the data can have a component outside the operator range. A least-squares solution of a linear inverse problem instead minimizesFor any variation , the adjoint operator givesThus statistical homogeneity in every direction is the normal equation for a linear inverse problem, . It is also sufficient for a global minimum: when it holds,The residual is orthogonal to the closure of the range, since it lies in . A normal-equation solution therefore fits the component of the data representable by the forward map, while leaving the perpendicular component unfitted. If there is more than one such solution, select the minimum-norm least-squares solution, which lies in .
These facts explain the formulation, but do not make the inverse problem well posed. A compact operator of infinite rank typically has nonclosed operator range, so even the least-squares infimum need not be attained. A least-squares solution exists exactly when the orthogonal projection of onto belongs to . In a singular system of a compact operator, this becomes the Picard criterion. Also, the nonzero eigenvalues of are the squares of the singular values of : solving the operator normal equation directly can worsen numerical conditioning. The operator normal equation expresses least squares; it does not itself regularize the inverse problem. The subsequent finite Landweber iteration and its stopping rule provide the inverse-problem regularization.
Choose a fixed positive Landweber relaxation parameter and rearrange the normal equation for a linear inverse problem as the fixed point equationSuccessive substitution gives Landweber iterationSet and . Induction yields the closed polynomial-operator expressionFor the sum is empty, giving zero. The expression is well defined without an inverse of , which can have a kernel of a linear map and an unbounded inverse on its range. Each iterate lies in the closure of , so initialization at zero eliminates the arbitrary null-space component of a solution. The unrelaxed choice gives and the corresponding sum with ; it needs the convergence restriction in part (d).
Use the convention required by the printed expansion:where and form the positive-singular-value parts of the singular system of a compact operator. Consequently . Apply part (b)'s polynomial to each such eigenvector, using noisy data:The geometric series then gives the full inverse coefficient, or Landweber full inverse filter,In particular, for the unrelaxed iteration , . The dimensionless Landweber spectral filter is instead ; the printed expression uses the full coefficient and therefore needs the denominator .
For each fixed finite , the filter extends continuously at zero by , since as . Small singular values are suppressed rather than immediately divided into noisy data. A component of in contributes nothing. The parameter here is discrete: is an integer. This matters when ; arbitrary real powers are not intended. A family for every can use instead.
For nonzero , a sufficient step-size condition for strong convergence of relaxed Landweber iteration isFor the unrelaxed iteration, this reads . The data must also admit a minimum-norm least-squares solution ; for the exact problem, is sufficient. More generally, the projected-data condition in part (a), or the Picard criterion , ensures the required solution.
Every positive singular value satisfies , so for fixed ,This is the correct inverse coefficient. For exact data with a least-squares solution, the norm error isThe summable majorant is precisely the Picard criterion, so the dominated convergence theorem proves strong convergence, despite the absence of a uniform contraction constant when the singular values approach zero. Initialization at zero selects the solution orthogonal to . At , a top singular mode of a nonzero compact operator has multiplier and can oscillate indefinitely; the strict step bound avoids this failure.
Pointwise convergence of filters alone is not a full noisy-data inverse-problem regularization proof. For each finite , put ; the step restriction gives , andThis proves the uniform noise bound for relaxed Landweber iterationTogether with the exact-data convergence,whenever and . Equivalently, the a priori regularization parameter choice satisfies and . For example, works as . The sharper familiar bound is available when .
Thus finite iteration followed by an appropriate stopping rule is a convergent regularization of an inverse problem. Taking for fixed noisy data is not the same operation and can amplify the small-singular-value noise without bound. If , the zero starting iterate stays zero and is the minimum-norm least-squares solution for every datum; the step restriction is needed only for nonzero .
Articles by others on the same topic
There are currently no matching articles.