Optimal Superconvergent One Step Nodal Cubic Spline Collocation Methods

DOI10.1137/040609793zbMath1091.65118OpenAlexW2073310466MaRDI QIDQ5470332

Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis

Publication date: 30 May 2006

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040609793

zbMATH Keywords

numerical experimentsfast Fourier transformssuperconvergenceelliptic boundary value problemsdirect methodsoptimal convergence ratescubic splinematrix decompositionnodal spline collocation

Mathematics Subject Classification ID

Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical methods for discrete and fast Fourier transforms (65T50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (7)

Modified nodal cubic spline collocation for three-dimensional variable coefficient second-order partial differential equations ⋮ Matrix decomposition algorithms for elliptic boundary value problems: A survey ⋮ A Qualocation Method for Parabolic Partial Integro-Differential Equations in One Space Variable ⋮ Optimal superconvergent one step quadratic spline collocation methods ⋮ Compact optimal quadratic spline collocation methods for the Helmholtz equation ⋮ A quadratic spline collocation method for the Dirichlet biharmonic problem ⋮ Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method

Uses Software

• FFTPACK

This page was built for publication: Optimal Superconvergent One Step Nodal Cubic Spline Collocation Methods