Superconvergent interpolants for collocation methods applied to Volterra integro-differential equations with delay

Standard software based on the collocation method for differential equations delivers a continuous approximation (called the collocation solution) which augments the high order discrete approximate solution that is provided at mesh points. This continuous approximation is less accurate than the discrete approximation. For ‘non-standard’ Volterra integro-differential equations with constant delay, that often arise in modeling predator-prey systems in Ecology, the collocation solution is C ⁰ continuous. The accuracy is O(h ^s+1) at off-mesh points and O(h ^2s ) at mesh points where s is the number of Gauss points used per subinterval and h refers to the stepsize. We will show how to construct C ¹ interpolants with an accuracy at off-mesh points and mesh points of the same order (2s). This implies that even for coarse mesh selections we achieve an accurate and smooth approximate solution. Specific schemes are presented for s=2, 3, and numerical results demonstrate the effectiveness of the new interpolants.     

An alternating direction implicit method for orthogonal spline collocation linear systems

Summary An Alternating Direction Implicit method is analyzed for the solution of linear systems arising in high-order, tensor-product orthogonal spline collocation applied to some separable, second order, linear, elliptic partial differential equations in rectangles. On anNxN partition, with Jordan's selection of the acceleration parameters, the method requiresO(N ² ln ² N) arithmetic operations to produce an approximation whose accuracy, in theH ¹-norm, is that of the collocation solution.     

Nonconforming spline collocation methods in irregular domains II: Error analysis

A nonconforming spline collocation method is investigated for elliptic PDEs in an irregular region with a triangular mesh. The existence and uniqueness of the spline collocation system and the optimal H¹ and L² ‐error analysis of the numerical solution are provided. Numerical experiments are presented to confirm the theoretical analysis and show the efficiency of this method. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 441–456 2012     

AC 0-collocation-like method for two-point boundary value problems

Summary A method of a collocation type based onC ⁰-piecewise polynomial spaces is presented for a two-point boundary value problem of the second order. The method has an optimal order of convergence under smoothness requirements on the exact solution which are weaker than forC ¹-collocation methods. If the differential operator is symmetric, a modification of this method leads to a symmetric system of linear equations. It is shown that if the collocation solution is a piecewise polynomial of degree not greater thanr, the method is stable and convergent with orderh ^r inH ¹-norm. A similar symmetric modification forC ⁰-colloction-finite element method [7] is also obtained. Superconvergence at the nodes is established.     

On the spline collocation method for the single layer equation related to time-fractional diffusion

The boundary element spline collocation method is studied for the time-fractional diffusion equation in a bounded two-dimensional domain. We represent the solution as the single layer potential which leads to a Volterra integral equation of the first kind. We discretize the boundary integral equation with the spline collocation method on uniform meshes both in spatial and time variables. In the stability analysis we utilize the Fourier analysis technique developed for anisotropic pseudodifferential equations. We prove that the collocation solution is quasi-optimal under some stability condition for the mesh parameters. We have to assume that the mesh parameter in time satisfies (h_t=c h^\frac2a)(h_t=c h^{\frac{2}{\alpha}}), where (h) is the spatial mesh parameter.     

A fourth–order orthogonal spline collocation method for two-dimensional Helmholtz problems with interfaces

Orthogonal spline collocation is implemented for the numerical solution of two-dimensional Helmholtz problems with discontinuous coefficients in the unit square. A matrix decomposition algorithm is used to solve the collocation matrix system at a cost of O(N² log N) on an N × N partition of the unit square. The results of numerical experiments demonstrate the efficacy of this approach, exhibiting optimal global estimates in various norms and superconvergence phenomena for a broad spectrum of wave numbers.     

A high‐order B‐spline collocation scheme for solving a nonhomogeneous time‐fractional diffusion equation

A high‐accuracy numerical approach for a nonhomogeneous time‐fractional diffusion equation with Neumann and Dirichlet boundary conditions is described in this paper. The time‐fractional derivative is described in the sense of Riemann‐Liouville and discretized by the backward Euler scheme. A fourth‐order optimal cubic B‐spline collocation (OCBSC) method is used to discretize the space variable. The stability analysis with respect to time discretization is carried out, and it is shown that the method is unconditionally stable. Convergence analysis of the method is performed. Two numerical examples are considered to demonstrate the performance of the method and validate the theoretical results. It is shown that the proposed method is of order O(Δx⁴ + Δt^{2 ? α}) convergence, where α ∈ (0,1) . Moreover, the impact of fractional‐order derivative on the solution profile is investigated. Numerical results obtained by the present method are compared with those obtained by the method based on standard cubic B‐spline collocation method. The CPU time for present numerical method and the method based on cubic B‐spline collocation method are provided.     

L p estimates of boundary integral equations for some nonlinear boundary value problems

Summary Recently, Galerkin and collocation methods have been analyzed for boundary integral equation formulations of some potential problems in the plane with nonlinear boundary conditions, and stability results and error estimates in theH ^1/2-norm have been proved (Ruotsalainen and Wendland, and Ruotsalainen and Saranen). We show that these results extend toL ^p setting without any extra conditions. These extensions are proved by studying the uniform boundedness of the inverses of the linearized integral operators, and then considering the nonlinear equations. The fact that inH ^1/2 setting the nonlinear operator is a homeomorphism with Lipschitz continuous inverse plays a crucial role. Optimal error estimates for the Galerkin and collocation method inL ^p space then follow.This research was performed while the second author was visiting professor at the University of Delaware, spring 1989     

Collocation for initial value problems

A collocation method for initial value problems, parametrized byn + 1, the number of collocation points, and , the step size, is shown (using Kantorovich's methods) to produce errors which are uniformlyO[/n] ^p+1 for linear time varying systems of ordinary differential equations whose solutions arepth order continuous. Using Wright's method, the single step error is shown to yield errors which areO[ ^n+k+2 for anyk, 0 <k <n, by suitable choice of the collocation points.     

A collocation method for differential equations with one‐point Taylor initial conditions

This paper presents a new multistep collocation method for nth order differential equations. The interval of interest is first divided into N subintervals. By determining interval conditions in Taylor interpolation in each subinterval, Taylor polynomials are calculated with different step lengths. Then the obtained solutions in each subinterval are used as initial conditions in the next step. Optimal error is assessed using Peano lemma, which shows that the errors decay by decreasing the step length. In particular, for fixed step length h, the error is of O(m^?m), where m is the number of collocation points in each subinterval. Meanwhile, for fixed m, the error is of O(h^m). Numerical examples demonstrate the validity and high accuracy of the proposed method even for stiff problems.     

An improvised collocation algorithm with specific end conditions for solving modified Burgers equation

In this work, numerical solution of nonlinear modified Burgers equation is obtained using an improvised collocation technique with cubic B‐spline as basis functions. In this technique, cubic B‐splines are forced to satisfy the interpolatory condition along with some specific end conditions. Crank–Nicolson scheme is used for temporal domain and improvised cubic B‐spline collocation method is used for spatial domain discretization. Quasilinearization process is followed to tackle the nonlinear term in the equation. Convergence of the technique is established to be of order O(h⁴ + Δt²) . Stability of the technique is examined using von‐Neumann analysis. L₂ and L_∞ error norms are calculated and are compared with those available in existing works. Results are found to be better and the technique is computationally efficient, which is shown by calculating CPU time.     

Analysis of alternating direction collocation methods for parabolic and hyperbolic problems in two space variables

While alternating direction implicit (ADI) collocation methods have been used for several years to solve parabolic problems in several space variables, no convergence analysis has been derived for any of these methods. We formulate and rigorously analyze ADI collocation schemes applied to the inhomogeneous heat and wave equations on the unit square subject to homogeneous Dirichlet boundary conditions and appropriate initial conditions. We prove that each method is second-order accurate in time and of optimal accuracy in space in the L² and H₀¹ norms. Numerical experiments confirm the predicted rates of convergence. © 1993 John Wiley & Sons, Inc.     

The algebraic theory approach for ordinary differential equations: Highly accurate finite differences

This article reports further developments of Herrera's algebraic theory approach to the numerical treatment of differential equations. A new solution procedure for ordinary differential equations is presented. Finite difference algorithms of 0(h^r), for arbitrary “r” are developed. The method consists in constructing local approximate solutions and using them to extract information about the sought solution. Only nodal information is derived. The local approximate solutions are constructed by collocation, using polynomials of degree G. When “n” collocation points are used at each subinterval, G = n + 1and the order of accuracy is 0(h^2n?1). The procedure here presented is very easy to implement. A program in which n can be chosen arbitrarily, was constructed and applied to selected examples.     

Alternating direction collocation for irregular regions

Several methods are presented for solving separable elliptic partial differential equations over an irregular region B using alternating direction collocation on a rectangular grid over an embedding rectangle R. The methods are geometric predictor-corrector schemes. At each iterative step, the numerical solution is predicted on R via a full ADI sweep. The forcing term is then updated (corrected) on collocation points interior to B. By this means, the geometry of B and boundary conditions on ∂B are approximated implicitly using rectangular grids on R. The methods are O(h⁴) in the L²(R) norm and are boundary exact, in that the computed solution converges exactly to the given boundary conditions on ∂B for appropriate choices of a pair of acceleration parameters. A number of examples are presented. Proof of convergence is established elsewhere. © 1996 John Wiley & Sons, Inc.     

On the super-approximation property of Galerkin's method with finite elements

Summary For Galerkin's method with finite elements as trial functions for strongly elliptic operator equations in the Hilbert scaleH ^t the super-approximation property and the optimal convergence rate are obtained by using the Aubin-Nitsche lemma. This applies in particular to spline collocation methods for a wide class of pseudodifferential equations.Dedicated to the memory of Professor Lothar Collatz     

Numerical solution of a certain hypersingular integral equation of the first kind

In this paper, we first discuss the midpoint rule for evaluating hypersingular integrals with the kernel sin ⁻²[(x−s)/2] defined on a circle, and the key point is placed on its pointwise superconvergence phenomenon. We show that this phenomenon occurs when the singular point s is located at the midpoint of each subinterval and obtain the corresponding supercovergence analysis. Then we apply the rule to construct a collocation scheme for solving the relevant hypersingular integral equation, by choosing the midpoints as the collocation points. It’s interesting that the inverse of coefficient matrix for the resulting linear system has an explicit expression, by which an optimal error estimate is established. At last, some numerical experiments are presented to confirm the theoretical analysis.     

Space‐time spectral collocation method for the one‐dimensional sine‐Gordon equation

In this article, we introduce a new space‐time spectral collocation method for solving the one‐dimensional sine‐Gordon equation. We apply a spectral collocation method for discretizing spatial derivatives, and then use the spectral collocation method for the time integration of the resulting nonlinear second‐order system of ordinary differential equations (ODE). Our formulation has high‐order accurate in both space and time. Optimal a priori error bounds are derived in the L²‐norm for the semidiscrete formulation. Numerical experiments show that our formulation have exponential rates of convergence in both space and time. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 670–690, 2015     

Evaluation of Chebyshev pseudospectral methods for third order differential equations

When the standard Chebyshev collocation method is used to solve a third order differential equation with one Neumann boundary condition and two Dirichlet boundary conditions, the resulting differentiation matrix has spurious positive eigenvalues and extreme eigenvalue already reaching O(N ⁵ for N = 64. Stable time-steps are therefore very small in this case. A matrix operator with better stability properties is obtained by using the modified Chebyshev collocation method, introduced by Kosloff and Tal Ezer [3]. By a correct choice of mapping and implementation of the Neumann boundary condition, the matrix operator has extreme eigenvalue less than O(N ⁴. The pseudospectral and modified pseudospectral methods are implemented for the solution of one-dimensional third-order partial differential equations and the accuracy of the solutions compared with those by finite difference techniques. The comparison verifies the stability analysis and the modified method allows larger time-steps. Moreover, to obtain the accuracy of the pseudospectral method the finite difference methods are substantially more expensive. Also, for the small N tested, N ⩽ 16, the modified pseudospectral method cannot compete with the standard approach. This revised version was published online in August 2006 with corrections to the Cover Date.     

Nonconforming spline collocation methods in irregular domains

This article studies a class of nonconforming spline collocation methods for solving elliptic PDEs in an irregular region with either triangular or quadrilateral partition. In the methods, classical Gaussian points are used as matching points and the special quadrature points in a triangle or quadrilateral element are used as collocation points. The solution and its normal derivative are imposed to be continuous at the marching points. The authors present theoretically the existence and uniqueness of the numerical solution as well as the optimal error estimate in H¹‐norm for a spline collocation method with rectangular elements. Numerical results confirm the theoretical analysis and illustrate the high‐order accuracy and some superconvergence features of methods. Finally the authors apply the methods for solving two physical problems in compressible flow and linear elasticity, respectively. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Chebyshev‐Legendre spectral method for solving the two‐dimensional vorticity equations with homogeneous Dirichlet conditions

The Chebyshev‐Legendre spectral method for the two‐dimensional vorticity equations is considered. The Legendre Galerkin Chebyshev collocation method is used with the Chebyshev‐Gauss collocation points. The numerical analysis results under the L²‐norm for the Chebyshev‐Legendre method of one‐dimensional case are generalized into that of the two‐dimensional case. The stability and optimal order convergence of the method are proved. Numerical results are given. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009