Given $f: [a,b] \to R $ and $K: [a,b]$ x $[a,b]$ $\to R$, we want to find a solution $\varphi:[a,b] \to R $ to the Fredholm integral equation:
$$\varphi(x) = f(x)+\int _{ a }^{ b }{ K( x,t)\varphi (t)dt } $$
For a given integer n, we will consider a set of n+1 equispaced points $x_0$ ,..., $x_n$ with $x_0 = a$ and $x_n = b$. We let $h = (b−a)/n$. We want to find values $\varphi_0$, ..., $\varphi_n$ such that $\varphi(x_i) \approx \varphi_i$ for $i = 1...n$. Note that we have for each i:
$$\varphi(x_i) = f(x_i)+\int _{ a }^{ b }{ K({ x }_{ i },t)\varphi (t)dt } $$
How would we discretize the above integral using points $x_0,...,x_n$ and values $\varphi_0,...,\varphi_n$ using an integration scheme?
How would we find the system of linear equations that determines the values $\varphi_0,...,\varphi_n$?
Any ideas?
You could use Simpson's rule to discretize the integral, which is indepedent from $x$ (I mean none of the limits are $x$) and for every $x$ sweeps the domain $(a,b)$. For your problem, this reads:
Notice that the LHS is independent from $j$ and $t_j = x_j$. Also, you may approach $\phi_{j+1/2} \approx (\phi_{j+1}+\phi_{j})/2$, as well as for $K_{i,j+1/2}$. If you expand a few terms of the sum for several values of $i$, I believe you can find the matrix formulation of the problem, which hopefully will be of the form:
with $A$ a $(n+1) \times (n+1) $ matrix and $C$ a $(n+1)\times 1$ vector.
Hope this helps!
PS: I have written $\phi$ instead of $\varphi$ for the sake of simplicity.
PS2: Spoiler