A fast iterative method for discretized Volterra-Fredholm integral equations (Q818218): Difference between revisions

The authors develop a method that reduces the cost of solving discretized versions of nonlinear Volterra-Fredholm integral equations of the form \[ u(t, x)=f(t,x)+\int_0^t \int_{\Omega} G(t, s, x, \xi, u(s, \xi))\,d\xi \,ds \] on a bounded spatial domain. The method introduced uses linear methods for both the Fredholm and for the Volterra parts of the equation. Semi-discretization in space by the Nyström method is followed by discretization in time by a direct quadrature method. The resulting system of nonlinear algebraic equations is (conventionally) solved using the (modified) Newton iteration scheme. The authors present and prove a theorem relating to the total error at the mesh points after \(\sigma\) Newton iterations. A new iterative method is introduced which reduces the computational complexity of the process. The inner iteration process used involves solving \((M+1)\) decoupled scalar equations, decoupled by a split of the coefficient matrix by a diagonal matrix. Convergence of this iterative linear solver is discussed and analyzed for kernels which are degererate with respect to the spatial variables, and for nondegenerate kernels of Hammerstein type (under the assumption that conditions for the existence and uniqueness of the solution are satisfied). Theorems relating to the convergence of the inner iteration process are stated. Results of numerical experiments illustrating the performance of the method are presented and discussed. The authors comment that many of the results obtained in the paper can be generalized to the case of an unbounded spatial domain. They intend this case, found in many applications, to be the focus of a later paper.