SIAM Journal on Numerical Analysis · 1984 · 75 citations · 10 references
Numerical AnalysisTheir DiscretizationsNumerical Method For Partial Differential EquationMethod Of Fundamental SolutionEngineeringResolvent KernelNumerical ComputationNumerical SimulationGlobal SuperconvergenceIterated Collocation ApproximationDefinite IntegralComputational MechanicsNumerical TreatmentApproximation TheoryBoundary Element MethodPolynomial Spline Collocation
It is known that the numerical solution of Volterra integral equations of the second kind by polynomial spline collocation at the Gauss–Legendre points does not lead to local superconvergence at the knots of the approximating function. In the present paper we show that iterated collocation approximation restores optimal local superconvergence at the knots but does not yield global superconvergence on the entire interval of integration, in contrast to Fredholm integral equations with smooth kernels. We also analyze the discretized versions (obtained by suitable numerical quadrature) of the collocation and iterated collocation methods.
10
Owe Axelsson · BIT Numerical Mathematics · 1969 · 124 citations
Numerical Analysis, Class Ofa-stable Methods, Engineering +4
Improvement by iteration for compact operator equations
Ian H. Sloan · Mathematics of Computation · 1976 · 114 citations · Full text