Solving the inverse problem of an inhomogeneous Fredholm integral equation by numerical method Fredholm equations involve definite integrals with fixed upper and lower limits. An inhomogeneous Fredholm equation of the first kind has the form (1) Here f ( s ) is the unknown function to be solved for, while g ( t ) is known. Fredholm equations of the first kind are often extremely ill-conditioned. Applying the kernel to a function is generally a smoothing operation, which often actually loses information, and there is no way to get it back in an inverse operation. Specialized methods have been developed for such equations, which are often called inverse problems. In general, some prior knowledge of the nature of the solution must be used, in one way or another, to restore the lost information. To allow the equation to be solved numerically we need to discretize the integral using some quadrature rules. Here we use the Gaussian-Legendre quadrature, yielding a linear system of equations for the unknown function f ( s ) as: (2) where ( t i , g i ) is the i -th experimental data set, N is the number of integration points, w j and s j are the quadrature weights and points, respectively. Most often we do not have enough data points to solve Eqn. 2 directly. Even if we have enough data points, it is still impossible to do so because of experimental uncertainty and/or measurement noises. Instead we seek the f ( s ) that satisfy: (3) However, the mere Eqn. 3 is not enough. When A is minimized, though the agreement is very good, the solution could become unstable, and in some way unrealistic because of the degenerate natures of the equations. We need to introduce another factor B , which is supposed to give a solution that is “smooth” or stable, and meanwhile has nothing to do with the measured data. In fact, the central idea of inverse theory is to find (4) for various values of 0 λ ∞, and then to settle on a “best” value of λ by certain criteria. How to determine the smoothing factor B ? Generally, if the priori belief is that a linear function is a good approximation to f(s) , we can take (5) If the priori belief is that a quadratic function is a good approximation, then we can take (6) To solve the optimization problem, we can use CVX, a package for specifying and solving convex programs that was developed by Michael Grant and Stephen Boyd from Stanford University. CVX is software based on MATLAB, and can be downloaded from the website: http://cvxr.com/cvx/download/ . The implementation of CVX in MATLAB is very simple. Just the following code segment will do the job. cvx_begin variable x(n) minimize( A(x)+lambda*B(x) ) subject to f = 0 f = 1 cvx_end An example of the solution of the inverse problem of inhomogeneous Fredholm integral equation of the first kind is to find the thermal conductivity accumulation function α based on experimental measurements of thermal conductivities of nanostructured materials. where L c is the characteristic length of nanostructure materials, is the mean free path of phonons, is the thermal conductivity accumulation function, which is defined as the fraction of thermal conductivity contributed by phonons with mean free paths shorter than .
标签: 反问题
