Abstract
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.
Similar content being viewed by others
References
A. A. Abushama and B. Bialecki, Modified nodal cubic spline collocation for biharmonic equations, Numer. Algorithms, 43 (2006), pp. 331–353.
A. A. Abushama and B. Bialecki, Modified nodal cubic spline collocation for Poisson’s equation, SIAM J. Numer. Anal., 46 (2008), pp. 397–418.
J. Adams, P. Swarztrauber, and R. Sweet, FISHPACK Efficient FORTRAN subprograms for the solution of separable elliptic partial differential equations, www.cisl.ucar.edu/css/software/fishpack (accessed August 24, 2008).
B. Bialecki and G. Fairweather, Orthogonal spline collocation methods for partial differential equations, J. Comput. Appl. Math., 128 (2001), pp. 55–82.
B. Bialecki, G. Fairweather, and A. Karageorghis, Matrix decomposition algorithms for modified spline collocation for Helmholtz problems, SIAM J. Sci. Comput., 24 (2003), pp. 1733–1753.
B. Bialecki, G. Fairweather, and A. Karageorghis, Optimal superconvergent one step nodal cubic spline collocation methods, SIAM J. Sci. Comput., 27 (2005), pp. 575–598.
B. Bialecki, G. Fairweather, A. Karageorghis, and Q. N. Nguyen, Optimal superconvergent one step quadratic spline collocation methods for Helmholtz problems, in Recent Advances in Computational Science, P. Jorgensen, X. Shen, C.-W. Shu, and N. Yan, eds., World Scientific, Singapore, 2008.
B. Bialecki, G. Fairweather, A. Karageorghis and Q. N. Nguyen, On the formulation and implementation of optimal superconvergent one step quadratic spline collocation methods for elliptic problems, Technical Report TR-18-2007, Dept. of Mathematics and Statistics, University of Cyprus, 2007. www.mas.ucy.ac.cy/english/technical_reports_eng207.htm (accessed May 18, 2008)
O. Betel, A high-order mass-lumping procedure for B-spline collocation method with application to incompressible flow simulations, Int. J. Numer. Methods Fluids, 41 (2003), pp. 1295–1318.
C. C. Christara, Quadratic spline collocation methods for elliptic partial differential equations, BIT, 34 (1994), pp. 33–61.
C. C. Christara and K. S. Ng, Fast Fourier transform solvers and preconditioners for quadratic spline collocation, BIT, 42 (2002), pp. 702–739.
A. Constas, Fast Fourier transforms solvers for quadratic spline collocation, M.Sc. thesis, Dept. of Computer Science, University of Toronto, Canada, July 1996.
B. Dembart, D. Gonsor, and M. Neamtu, Bivariate quadratic B-splines used as basis functions for collocation, in Mathematics for Industry: Challenges and Frontiers, SIAM, Philadelphia, PA, 2005, pp. 178–198.
E. N. Houstis, C. C. Christara, and J. R. Rice, Quadratic-spline collocation methods for two-point boundary value problems, Int. J. Numer. Methods Eng., 26 (1988), pp. 935–952.
E. N. Houstis, E. A. Vavalis, and J. R. Rice, Convergence of O(h 4) cubic spline collocation methods for elliptic partial differential equations, SIAM J. Numer. Anal., 25 (1988), pp. 54–74.
R. W. Johnson, A B-spline collocation method for solving the incompressible Navier–Stokes equations using an ad-hoc method: the Boundary Residual method, Comput. Fluids, 34 (2005), pp. 121–149.
A. K. Khalifa, K. R. Raslan, and H. M. Alzubaidi, A collocation method with cubic B-splines for solving the MRLW equation, J. Comput. Appl. Math., 212 (2008), pp. 406–418.
Q. N. Nguyen, Matrix decomposition algorithms for modified quadratic spline collocation for Helmholtz problems, M.S. thesis, Dept. of Mathematical and Computer Sciences, Colorado School of Mines, Golden, Colorado, June 2005.
S. C. S. Rao and M. Mukar, Optimal B-spline collocation method for self-adjoint singularly perturbed boundary-value problems, Appl. Math. Comput., 188 (2007), pp. 749–761.
K. R. Raslan, A collocation solution for Burgers equation using quadratic B-spline finite elements, Int. J. Comput. Math., 80 (2003), pp. 931–938.
P. N. Swarztrauber, Algorithm 541. Efficient Fortran subprograms for the solution of separable elliptic partial differential equations, ACM Trans. Math. Softw., 5 (1979), pp. 352–364.
P. N. Swarztrauber, FFTPACK, NCAR, Boulder, CO, 1985. (Also available from netlib@ornl.gov)
Z. Wang, Modified nodal spline collocation methods for elliptic and parabolic problems, Ph.D. thesis, Dept. of Mathematical and Computer Sciences, Colorado School of Mines, Golden, Colorado, August 2006.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification (2000)
65N35, 65N22
Rights and permissions
About this article
Cite this article
Bialecki, B., Fairweather, G., Karageorghis, A. et al. Optimal superconvergent one step quadratic spline collocation methods . Bit Numer Math 48, 449–472 (2008). https://doi.org/10.1007/s10543-008-0188-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10543-008-0188-6