Indirect Fourier transformation

From testwiki
Revision as of 16:47, 25 February 2025 by imported>Citation bot (Added bibcode. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Fourier analysis | #UCB_Category 121/126)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In a Fourier transformation (FT), the Fourier transformed function f^(s) is obtained from f(t) by:

f^(s)=f(t)eistdt

where i is defined as i2=1. f(t) can be obtained from f^(s) by inverse FT:

f(t)=12πf^(s)eistdt

s and t are inverse variables, e.g. frequency and time.

Obtaining f^(s) directly requires that f(t) is well known from t= to t=, vice versa. In real experimental data this is rarely the case due to noise and limited measured range, say f(t) is known from a> to b<. Performing a FT on f(t) in the limited range may lead to systematic errors and overfitting.

An indirect Fourier transform (IFT) is a solution to this problem.

Indirect Fourier transformation in small-angle scattering

In small-angle scattering on single molecules, an intensity I(𝐫) is measured and is a function of the magnitude of the scattering vector q=|𝐪|=4πsin(θ)/λ, where 2θ is the scattered angle, and λ is the wavelength of the incoming and scattered beam (elastic scattering). q has units 1/length. I(q) is related to the so-called pair distance distribution p(r) via Fourier Transformation. p(r) is a (scattering weighted) histogram of distances r between pairs of atoms in the molecule. In one dimensions (r and q are scalars), I(q) and p(r) are related by:

I(q)=4πnp(r)eiqrcos(ϕ)dr
p(r)=12π2n(^qr)2I(q)eiqrcos(ϕ)dq

where ϕ is the angle between 𝐪 and 𝐫, and n is the number density of molecules in the measured sample. The sample is orientational averaged (denoted by ..), and the Debye equation [1] can thus be exploited to simplify the relations by

eiqrcos(ϕ)=eiqrcos(ϕ)=sin(qr)qr

In 1977 Glatter proposed an IFT method to obtain p(r) form I(q),[2] and three years later, Moore introduced an alternative method.[3] Others have later introduced alternative methods for IFT,[4] and automatised the process [5][6]

The Glatter method of IFT

This is an brief outline of the method introduced by Otto Glatter.[2] For simplicity, we use n=1 in the following.

In indirect Fourier transformation, a guess on the largest distance in the particle Dmax is given, and an initial distance distribution function pi(r) is expressed as a sum of N cubic spline functions ϕi(r) evenly distributed on the interval (0,pi(r)):

Template:NumBlk

where ci are scalar coefficients. The relation between the scattering intensity I(q) and the p(r) is:

Template:NumBlk

Inserting the expression for pi(r) (1) into (2) and using that the transformation from p(r) to I(q) is linear gives:

I(q)=4πi=1Nciψi(q),

where ψi(q) is given as:

ψi(q)=0ϕi(r)sin(qr)qrdr.

The ci's are unchanged under the linear Fourier transformation and can be fitted to data, thereby obtaining the coefficients cifit. Inserting these new coefficients into the expression for pi(r) gives a final pf(r). The coefficients cifit are chosen to minimise the χ2 of the fit, given by:

χ2=k=1M[Iexperiment(qk)Ifit(qk)]2σ2(qk)

where M is the number of datapoints and σk is the standard deviations on data point k. The fitting problem is ill posed and a very oscillating function would give the lowest χ2 despite being physically unrealistic. Therefore, a smoothness function S is introduced:

S=i=1N1(ci+1ci)2.

The larger the oscillations, the higher S. Instead of minimizing χ2, the Lagrangian L=χ2+αS is minimized, where the Lagrange multiplier α is denoted the smoothness parameter. The method is indirect in the sense that the FT is done in several steps: pi(r)fittingpf(r).

See also

References