Journal of Numerical Mathematics · 2005 · 22 citations · 14 references
Numerical AnalysisMethod Of Fundamental SolutionPiecewise PolynomialsEngineeringResolvent KernelIterated Galerkin SolutionNumerical ComputationSemi-implicit MethodGalerkin MethodApproximation TheoryBoundary Element MethodNumerical Method For Partial Differential Equation
For a second kind integral equation with a kernel which is less smooth along the diagonal, an approximate solution obtained by using a method proposed by the author in an earlier paper, is shown to have a higher rate of convergence than the iterated Galerkin solution. The projection is chosen to be either the orthogonal projection or an interpolatory projection onto a space of piecewise polynomials. The size of the system of equations that needs to be solved, in order to compute the proposed solution, remains the same as in the Galerkin method. The improvement of the proposed solution is illustrated by a numerical example.
14
Improvement by iteration for compact operator equations
Ian H. Sloan · Mathematics of Computation · 1976 · 114 citations · Full text