TY - JOUR

T1 - On the asymptotic convergence of collocation methods

AU - Arnold, Douglas N.

AU - Wendland, Wolfgang L.

PY - 1983/10

Y1 - 1983/10

N2 - We prove quasioptimal and optimal order estimates in various Sobolev norms for the approximation of linear strongly elliptic pseudodifferential equations in one independent variable by the method of nodal collocation by odd degree polynomial splines. The analysis pertains in particular to many of the boundary element methods used for numerical computation in engineering applications. Equations to which the analysis is applied include Fredholm integral equations of the second kind, certain first kind Fredholm equations, singular integral equations involving Cauchy kernels, a variety of integro-differential equations, and two-point boundary value problems for ordinary differential equations. The error analysis is based on an equivalence which we establish between the collocation methods and certain nonstandard Galerkin methods. We compare the collocation method with a standard Galerkin method using splines of the same degree, showing that the Galerkin method is quasioptimal in a Sobolev space of lower index and furnishes optimal order approximation for a range of Sobolev indices containing and extending below that for the collocation method, and so the standard Galerkin method achieves higher rates of convergence.

AB - We prove quasioptimal and optimal order estimates in various Sobolev norms for the approximation of linear strongly elliptic pseudodifferential equations in one independent variable by the method of nodal collocation by odd degree polynomial splines. The analysis pertains in particular to many of the boundary element methods used for numerical computation in engineering applications. Equations to which the analysis is applied include Fredholm integral equations of the second kind, certain first kind Fredholm equations, singular integral equations involving Cauchy kernels, a variety of integro-differential equations, and two-point boundary value problems for ordinary differential equations. The error analysis is based on an equivalence which we establish between the collocation methods and certain nonstandard Galerkin methods. We compare the collocation method with a standard Galerkin method using splines of the same degree, showing that the Galerkin method is quasioptimal in a Sobolev space of lower index and furnishes optimal order approximation for a range of Sobolev indices containing and extending below that for the collocation method, and so the standard Galerkin method achieves higher rates of convergence.

UR - http://www.scopus.com/inward/record.url?scp=84966248635&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84966248635&partnerID=8YFLogxK

U2 - 10.1090/S0025-5718-1983-0717691-6

DO - 10.1090/S0025-5718-1983-0717691-6

M3 - Article

AN - SCOPUS:84966248635

SN - 0025-5718

VL - 41

SP - 349

EP - 381

JO - Mathematics of Computation

JF - Mathematics of Computation

IS - 164

ER -