Wiener–Hopf method - Alchetron, The Free Social Encyclopedia

The Wiener–Hopf method is a mathematical technique widely used in applied mathematics. It was initially developed by Norbert Wiener and Eberhard Hopf as a method to solve systems of integral equations, but has found wider use in solving two-dimensional partial differential equations with mixed boundary conditions on the same boundary. In general, the method works by exploiting the complex-analytical properties of transformed functions. Typically, the standard Fourier transform is used, but examples exist using other transforms, such as the Mellin transform.

In general, the governing equations and boundary conditions are transformed and these transforms are used to define a pair of complex functions (typically denoted with '+' and '−' subscripts) which are respectively analytic in the upper and lower halves of the complex plane, and have growth no faster than polynomials in these regions. These two functions will also coincide on some region of the complex plane, typically, a thin strip containing the real line. Analytic continuation guarantees that these two functions define a single function analytic in the entire complex plane, and Liouville's theorem implies that this function is an unknown polynomial, which is often zero or constant. Analysis of the conditions at the edges and corners of the boundary allows one to determine the degree of this polynomial.

Wiener–Hopf decomposition

The key step in many Wiener–Hopf problems is to decompose an arbitrary function Φ into two functions Φ ± with the desired properties outlined above. In general, this can be done by writing

Φ + ( α ) = 1 2 π i ∫ C 1 Φ ( z ) d z z − α

and

Φ − ( α ) = − 1 2 π i ∫ C 2 Φ ( z ) d z z − α ,

where the contours C 1 and C 2 are parallel to the real line, but pass above and below the point z = α , respectively.

Similarly, arbitrary scalar functions may be decomposed into a product of +/− functions, i.e. K ( α ) = K + ( α ) K − ( α ) , by first taking the logarithm, and then performing a sum decomposition. Product decompositions of matrix functions (which occur in coupled multi-modal systems such as elastic waves) are considerably more problematic since the logarithm is not well defined, and any decomposition might be expected to be non-commutative. A small subclass of commutative decompositions were obtained by Khrapkov, and various approximate methods have also been developed.

Example

Let us consider the linear partial differential equation

L x y f ( x , y ) = 0 ,

where L x y is a linear operator which contains derivatives with respect to x and y, subject to the mixed conditions on y=0, for some prescribed function g(x),

f = g ( x ) for x ≤ 0 , f y = 0 when x > 0

and decay at infinity i.e. f→0 as x → ∞ .

Taking a Fourier transform with respect to x results in the following ordinary differential equation

L y f ^ ( k , y ) − P ( k , y ) f ^ ( k , y ) = 0 ,

where L y is a linear operator containing y derivatives only, P(k,y) is a known function of y and k and

f ^ ( k , y ) = ∫ − ∞ ∞ f ( x , y ) e − i k x d x .

If a particular solution of this ordinary differential equation which satisfies the necessary decay at infinity is denoted F(k,y), a general solution can be written as

f ^ ( k , y ) = C ( k ) F ( k , y ) ,

where C(k) is an unknown function to be determined by the boundary conditions on y=0.

The key idea is to split f ^ into two separate functions, f ^ + and f ^ − which are analytic in the lower- and upper-halves of the complex plane, respectively,

f ^ + ( k , y ) = ∫ 0 ∞ f ( x , y ) e − i k x d x , f ^ − ( k , y ) = ∫ − ∞ 0 f ( x , y ) e − i k x d x .

The boundary conditions then give

g ^ ( k ) + f ^ + ( k , 0 ) = f ^ − ( k , 0 ) + f ^ + ( k , 0 ) = f ^ ( k , 0 ) = C ( k ) F ( k , 0 )

and, on taking derivatives with respect to y ,

f ^ − ′ ( k , 0 ) = f ^ − ′ ( k , 0 ) + f ^ + ′ ( k , 0 ) = f ^ ′ ( k , 0 ) = C ( k ) F ′ ( k , 0 ) .

Eliminating C ( k ) yields

g ^ ( k ) + f ^ + ( k , 0 ) = f ^ − ′ ( k , 0 ) / K ( k ) ,

where

K ( k ) = F ′ ( k , 0 ) F ( k , 0 ) .

Now K ( k ) can be decomposed into the product of functions K − and K + which are analytic in the upper and lower half-planes respectively.

To be precise, K ( k ) = K + ( k ) K − ( k ) , where

log K − = 1 2 π i ∫ − ∞ ∞ log ( K ( z ) ) z − k d z , Im k > 0 , log K + = − 1 2 π i ∫ − ∞ ∞ log ( K ( z ) ) z − k d z , Im k < 0.

(Note that this sometimes involves scaling K so that it tends to 1 as k → ∞ .) We also decompose K + g ^ into the sum of two functions G + and G − which are analytic in the lower and upper half-planes respectively, i.e.,

This can be done in the same way that we factorised K ( k ) . Consequently,

G + ( k ) + K + ( k ) f ^ + ( k , 0 ) = f ^ − ′ ( k , 0 ) / K − ( k ) − G − ( k ) .

Now, as the left-hand side of the above equation is analytic in the lower half-plane, whilst the right-hand side is analytic in the upper half-plane, analytic continuation guarantees existence of an entire function which coincides with the left- or right-hand sides in their respective half-planes. Furthermore, since it can be shown that the functions on either side of the above equation decay at large k, an application of Liouville's theorem shows that this entire function is identically zero, therefore

f ^ + ( k , 0 ) = − G + ( k ) K + ( k ) ,

and so

C ( k ) = K + ( k ) g ^ ( k ) − G + ( k ) K + ( k ) F ( k , 0 ) .

References

Wiener–Hopf method Wikipedia

(Text) CC BY-SA

Contents

Wiener–Hopf decomposition

Example

References