A spline collocation method for parabolic pseudodifferential equations

The purpose of this paper is to examine a boundary element collocation method for some parabolic pseudodifferential equations. The basic model problem for our investigation is the two-dimensional heat conduction problem with vanishing initial condition and a given Neumann or Dirichlet type boundary condition. Certain choices of the representation formula for the heat potential yield boundary integral equations of the first kind, namely the single layer and the hypersingular heat operator equations. Both of these operators, in particular, are covered by the class of parabolic pseudodifferential operators under consideration. Moreover, the spatial domain is allowed to have a general smooth boundary curve. As trial functions the tensor products of the smoothest spline functions of odd degree (space) and continuous piecewise linear splines (time) are used. Stability and convergence of the method is proved in some appropriate anisotropic Sobolev spaces.     

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     

On spline collocation for convolution equations

We consider the numerical solution of Wiener-Hopf integral equations and Mellin convolution equations by collocation methods and their iterated and discrete variants, using piecewise polynomials as basis functions. In the present paper we obtain results on stability and optimal convergence in the L^p norm generalizing those of [4]–[6] and [9].     

Fast algorithms for high-order spline collocation systems

Summary. In this paper, we present a complete eigenvalue analysis for arbitrary order -spline collocation methods applied to the Poisson equation on a rectangular domain with Dirichlet boundary conditions. Based on this analysis, we develop some fast algorithms for solving a class of high-order spline collocation systems which arise from discretizing the Poisson equation. Received April 8, 1997 / Revised version received August 29, 1997     

Orthogonal spline collocation methods for biharmonic problems

Orthogonal spline collocation methods are formulated and analyzed for the solution of certain biharmonic problems in the unit square. Particular attention is given to the Dirichlet biharmonic problem which is solved using capacitance matrix techniques. Received November 11, 1996     

Convergence of spline collocation for Volterra integral equations

Estimates for step-by-step interpolation projections are established. Depending on the spectrum of the transfer matrix these estimates allow to obtain the pointwise convergence of the projectors to the identity operator or, in some limit cases, to prove stable convergence of the corresponding approximate operators of integral equations. This, via general convergence theorems for operator equations, permits to get the convergence of collocation method for Volterra integral equations of the second kind in spaces of continuous or certain times continuously differentiable functions. Applications in the case of the most practical types of splines are analyzed.     

Modified nodal cubic spline collocation for biharmonic equations

We formulate a modified nodal cubic spline collocation scheme for the solution of the biharmonic Dirichlet problem on the unit square. We prove existence and uniqueness of a solution of the scheme and show how the scheme can be solved on an N × N uniform partition of the square at a cost O(N ² log₂ N + mN ²) using fast Fourier transforms and m iterations of the preconditioned conjugate gradient method. We demonstrate numerically that m proportional to log₂ N guarantees the desired convergence rates. Numerical results indicate the fourth order accuracy of the approximations in the global maximum norm and the fourth order accuracy of the approximations to the first order partial derivatives at the partition nodes.      

Multigrid and multilevel methods for quadratic spline collocation

Multigrid methods are developed and analyzed for quadratic spline collocation equations arising from the discretization of one-dimensional second-order differential equations. The rate of convergence of the two-grid method integrated with a damped Richardson relaxation scheme as smoother is shown to be faster than 1/2, independently of the step-size. The additive multilevel versions of the algorithms are also analyzed. The development of quadratic spline collocation multigrid methods is extended to two-dimensional elliptic partial differential equations. Multigrid methods for quadratic spline collocation methods are not straightforward: because the basis functions used with quadratic spline collocation are not nodal basis functions, the design of efficient restriction and extension operators is nontrivial. Experimental results, with V-cycle and full multigrid, indicate that suitably chosen multigrid iteration is a very efficient solver for the quadratic spline collocation equations. Supported by Communications and Information Technology Ontario (CITO), Canada. Supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational and Technology Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

Optimal superconvergent one step quadratic spline collocation methods

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. AMS subject classification (2000)  65N35, 65N22     

Modified nodal cubic spline collocation for elliptic equations

We consider the modified nodal cubic spline collocation method for a general, variable coefficient, second order partial differential equation in the unit square with the solution subject to the homogeneous Dirichlet boundary conditions. The bicubic spline approximate solution satisfies both the Dirichlet boundary conditions and a perturbed partial differential equation at the nodes of a uniform partition of the square. We prove existence and uniqueness of the approximate solution and derive an optimal fourth order maximum norm error bound. The resulting linear system is solved efficiently by a preconditioned iterative method. Numerical results confirm the expected convergence rates. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2011     

Preconditioning cubic spline collocation discretizations of elliptic equations

Summary. This work considers the uniformly elliptic operator defined by in (the unit square) with boundary conditions: on and on and its discretization based on Hermite cubic spline spaces and collocation at the Gauss points. Using an interpolatory basis with support on the Gauss points one obtains the matrix . We discuss the condition numbers and the distribution of -singular values of the preconditioned matrices where is the stiffness matrix associated with the finite element discretization of the positive definite uniformly elliptic operator given by in with boundary conditions: on on . The finite element space is either the space of continuous functions which are bilinear on the rectangles determined by Gauss points or the space of continuous functions which are linear on the triangles of the triangulation of using the Gauss points. When we obtain results on the eigenvalues of . In the general case we obtain bounds and clustering results on the -singular values of . These results are related to the results of Manteuffel and Parter [MP], Parter and Wong [PW], and Wong [W] for finite element discretizations as well as the results of Parter and Rothman [PR] for discretizations based on Legendre Spectral Collocation. Received January 1, 1994 / Revised version received February 7, 1995     

A spline collocation method for singular integral equations with piecewise continuous coefficients

We consider the collocation method with piecewise linear trial functions for systems of singular integral equations with Cauchy kernel and piecewise continuous coefficients. Necessary and sufficient conditions for the stability in L² are given. The results are obtained in the case of a closed Ljapunov curve as well as in the case of an interval. The proof of the main theorem is based on a modification of the Banach algebra technique established in the local principle by Gohberg and Krupnik [2]. Our results extend those obtained by Prößdorf and Schmidt [9, 10] from the case of continuous coefficients and unit circle to the case of piecewise continuous coefficients.     

Quadratic spline collocation methods for elliptic partial differential equations

We consider Quadratic Spline Collocation (QSC) methods for linear second order elliptic Partial Differential Equations (PDEs). The standard formulation of these methods leads to non-optimal approximations. In order to derive optimal QSC approximations, high order perturbations of the PDE problem are generated. These perturbations can be applied either to the PDE problem operators or to the right sides, thus leading to two different formulations of optimal QSC methods. The convergence properties of the QSC methods are studied. OptimalO(h ^3–j ) global error estimates for thejth partial derivative are obtained for a certain class of problems. Moreover,O(h ^4–j ) error bounds for thejth partial derivative are obtained at certain sets of points. Results from numerical experiments verify the theoretical behaviour of the QSC methods. Performance results also show that the QSC methods are very effective from the computational point of view. They have been implemented efficiently on parallel machines.This research was supported in part by David Ross Foundation (U.S.A) and NSERC (Natural Sciences and Engineering Research Council of Canada).     

Numerical solution of a quasilinear algebraic differential system by the spline collocation method

In this paper, a quasilinear algebraic differential system is considered. To solve the system numerically, a spline collocation method is used. A convergence theorem for numerical processes is proved. Results of numerical experiments are presented.     

A spline collocation method for multidimensional strongly elliptic pseudodifferential operators of order zero

In the present paper we prove the stability of a nodal spline collocation method for (locally) strongly elliptic zero order pseudodifferential equations inL ² (), where is a bounded Lipschitz domain in ⁿ . As trial functions we use multi-polynomial splines of odd multi-degree on a rectangular grid. The key of our analysis is the reduction to the case of an operator with frozen symbol by using a local principle due to one of the authors [30]. Moreover, for a right hand sightf H ³ (),s>n/2, we obtain an asymptotic error estimate. Finally we extend these results to the case of (locally) strongly elliptic pseudodifferential equations on the torusT ⁿ.Dedicated to Prof. Dr. E. Meister on the occasion of his 60th birthdayThe second author has been supported by a grant of Deutsche Forschungsgemeinschaft under grant number Ko 634/32-1. This work was carried out while the first author was visiting the Technische Hochschule Darmstadt.     

On spline collocation methods for boundary integral equations in the plane

Nowadays boundary elemen; methods belong to the most popular numerical methods for solving elliptic boundary value problems. They consist in the reduction of the problem to equivalent integral equations (or certain generalizations) on the boundary Γ of the given domain and the approximate solution of these boundary equations. For the numerical treatment the boundary surface is decomposed into a finite number of segments and the unknown functions are approximated by corresponding finite elements and usually determined by collocation and Galerkin procedures. One finds the least difficulties in the theoretical foundation of the convergence of Galerkin methods for certain classes of equations, whereas the convergence of collocation methods, which are mostly used in numerical computations, has yet been proved only for special equations and methods. In the present paper we analyse spline collocation methods on uniform meshes with variable collocation points for one-dimensional pseudodifferential equations on a closed curve with convolutional principal parts, which encompass many classes of boundary integral equations in the plane. We give necessary and sufficient conditions for convergence and prove asymptotic error estimates. In particular we generalize some results on nodal and midpoint collocation obtained in [2], [7] and [8]. The paper is organized as follows. In Section 1 we formulate the problems and the results, Section 2 deals with spline interpolation in periodic Sobolev spaces, and in Section 3 we prove the convergence theorems for the considered collocation methods.     

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     

Quadratic spline collocation for one-dimensional linear parabolic partial differential equations

New methods for solving general linear parabolic partial differential equations (PDEs) in one space dimension are developed. The methods combine quadratic-spline collocation for the space discretization and classical finite differences, such as Crank-Nicolson, for the time discretization. The main computational requirements of the most efficient method are the solution of one tridiagonal linear system at each time step, while the resulting errors at the gridpoints and midpoints of the space partition are fourth order. The stability and convergence properties of some of the new methods are analyzed for a model problem. Numerical results demonstrate the stability and accuracy of the methods. Adaptive mesh techniques are introduced in the space dimension, and the resulting method is applied to the American put option pricing problem, giving very competitive results.     

Computations on preconditioning cubic spline collocation method of elliptic equations

In this work we investigate the finite element preconditioning method for theC ¹-cubic spline collocation discretizations for an elliptic operatorA defined byAu:=−Δu+a ₁ u _x +a ₂ u _y +a ₀ u in the unit square with some boundary conditions. We compute the condition number and the numerical solution of the preconditioning system for the several example problems. Finally, we compare the this preconditioning system with the another preconditioning system.     

Finite difference preconditioning cubic spline collocation method of elliptic equations

Summary. We discuss a finite difference preconditioner for the interpolatory cubic spline collocation method for a uniformly elliptic operator defined by in (the unit square) with homogeneous Dirichlet boundary conditions. Using the generalized field of values arguments, we discuss the eigenvalues of the preconditioned matrix where is the matrix of the collocation discretization operator corresponding to , and is the matrix of the finite difference operator corresponding to the uniformly elliptic operator given by in with homogeneous Dirichlet boundary conditions. Finally we mention a bound of -singular values of for a general elliptic operator in . Received December 11, 1995 / Revised version received June 20, 1996