Optimal superconvergent one step quadratic spline collocation methods
Date
2008Source
BIT Numerical MathematicsVolume
48Issue
3Pages
449-472Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We formulate new optimal quadratic spline collocation methods for the solution of various elliptic boundary value problems in the unit square. These methods are constructed so that the collocation equations can be solved using a matrix decomposition algorithm. The results of numerical experiments exhibit the expected optimal global accuracy as well as superconvergence phenomena. © Springer 2008.