Symmetric collocation methods for linear differential-algebraic boundary value problems

Summary. We present symmetric collocation methods for linear differential-algebraic boundary value problems without restrictions on the index or the structure of the differential-algebraic equation. In particular, we do not require a separation into differential and algebraic solution components. Instead, we use the splitting into differential and algebraic equations (which arises naturally by index reduction techniques) and apply Gau?-type (for the differential part) and Lobatto-type (for the algebraic part) collocation schemes to obtain a symmetric method which guarantees consistent approximations at the mesh points. Under standard assumptions, we show solvability and stability of the discrete problem and determine its order of convergence. Moreover, we show superconvergence when using the combination of Gau? and Lobatto schemes and discuss the application of interpolation to reduce the number of function evaluations. Finally, we present some numerical comparisons to show the reliability and efficiency of the new methods. Received September 22, 2000 / Revised version received February 7, 2001 / Published online August 17, 2001     

The spectral collocation method for efficiently solving PDEs with fractional Laplacian

We derive a spectral collocation approximation to the fractional Laplacian operator based on the Riemann-Liouville fractional derivative operators on a bounded domain Ω = [a, b]. Corresponding matrix representations of (?△) ^α/2 for α ∈ (0,1) and α ∈ (1,2) are obtained. A space-fractional advection-dispersion equation is then solved to investigate the numerical performance of this method under various choices of parameters. It turns out that the proposed method has high accuracy and is efficient for solving these space-fractional advection-dispersion equations when the forcing term is smooth.     

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.     

A collocation method for boundary value problems

Collocation with piecewise polynomial functions is developed as a method for solving two-point boundary value problems. Convergence is shown for a general class of linear problems and a rather broad class of nonlinear problems. Some computational examples are presented to illustrate the wide applicability and efficiency of the procedure.     

Error control Gaussian collocation software for boundary value ODEs and 1D time-dependent PDEs

Numerical Algorithms - Error control software packages based on Gaussian collocation have been widely used for the numerical solution of boundary value ODEs (BVODEs) and 1D parabolic time-dependent...     

An adaptive least-squares collocation radial basis function method for the HJB equation

We present a novel numerical method for the Hamilton–Jacobi–Bellman equation governing a class of optimal feedback control problems. The spatial discretization is based on a least-squares collocation Radial Basis Function method and the time discretization is the backward Euler finite difference. A stability analysis is performed for the discretization method. An adaptive algorithm is proposed so that at each time step, the approximate solution can be constructed recursively and optimally. Numerical results are presented to demonstrate the efficiency and accuracy of the method.     

Sinc collocation method with boundary treatment for two-point boundary value problems

Sinc collocation method is proven to provide an exponential convergence rate in solving linear differential equations, even in the presence of singularities. But in order to treat the derivatives on boundaries, people often relied on the finite difference method, which would be expected to limit the accuracy. The present paper develops a Sinc collocation method with boundary treatment for two-point boundary value problems. Numerical results show that the method can directly and efficiently handle the boundary derivatives.     

An adaptive Richardson iteration method for indefinite linear systems

An adaptive Richardson iteration method is presented for the solution of large linear systems of equations with a sparse, symmetric, nonsingular, indefinite matrix. The relaxation parameters for Richardson iteration are chosen to be reciprocal values of Leja points for a compact setK:=[a,b][c,d], where [a,b] is an interval on the negative real axis and [c, d] is an interval on the positive real axis. Endpoints of these intervals are determined adaptively by computing certain modified moments during the iterations. Computed examples show that this adaptive Richardson method can be competitive with the SYMMLQ and the conjugate residual methods, which are based on the Lanczos process.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayResearch supported in part by the Design and Manufacturing Institute at Stevens Institute of Technology.Research supported in part by NSF grants DMS-9002884 and DMS-9205531.     

Spectral collocation method for linear fractional integro-differential equations

In this paper, we propose and analyze a spectral Jacobi-collocation method for the numerical solution of general linear fractional integro-differential equations. The fractional derivatives are described in the Caputo sense. First, we use some function and variable transformations to change the equation into a Volterra integral equation defined on the standard interval [-1,1]$[-1\text{,}1]$. Then the Jacobi–Gauss points are used as collocation nodes and the Jacobi–Gauss quadrature formula is used to approximate the integral equation. Later, the convergence order of the proposed method is investigated in the infinity norm. Finally, some numerical results are given to demonstrate the effectiveness of the proposed method.     

Numerical solutions based on Chebyshev collocation method for singularly perturbed delay parabolic PDEs

The main purpose of this work is to provide a numerical approach for the delay partial differential equations based on a spectral collocation approach. In this research, a rigorous error analysis for the proposed method is provided. The effectiveness of this approach is illustrated by numerical experiments on two delay partial differential equations. Copyright © 2013 John Wiley & Sons, Ltd.     

Spline collocation method for linear singular hyperbolic systems

Some classes of singular systems of partial differential equations with variable matrix coefficients and internal hyperbolic structure are considered. The spline collocation method is used to numerically solve such systems. Sufficient conditions for the convergence of the numerical procedure are obtained. Numerical results are presented.     

Multiscale RBF collocation for solving PDEs on spheres

In this paper, we discuss multiscale radial basis function collocation methods for solving certain elliptic partial differential equations on the unit sphere. The approximate solution is constructed in a multi-level fashion, each level using compactly supported radial basis functions of smaller scale on an increasingly fine mesh. Two variants of the collocation method are considered (sometimes called symmetric and unsymmetric, although here both are symmetric). A convergence theory is given, which builds on recent theoretical advances for multiscale approximation using compactly supported radial basis functions.     

An iterated Radau method for time-dependent PDEs

This paper is concerned with the time integration of semi-discretized, multi-dimensional PDEs of advection-diffusion-reaction type. To cope with the stiffness of these ODEs, an implicit method has been selected, viz., the two-stage, third-order Radau IIA method. The main topic of this paper is the efficient solution of the resulting implicit relations. First, a modified Newton process has been transformed into an iteration process in which the 2 stages are decoupled and, moreover, can exploit the same LU-factorization of the iteration matrix. Next, we apply a so-called Approximate Matrix Factorization (AMF) technique to solve the linear systems in each Newton iteration. This AMF approach is very efficient since it reduces the ‘multi-dimensional’ system to a series of ‘one-dimensional’ systems. The total amount of linear algebra work involved is reduced enormously by this approach. The idea of applying AMF to two-dimensional problems is quite old and goes back to Peaceman and Rachford in the early fifties. The situation in three space dimensions is less favourable and will be analyzed here in more detail, both theoretically and experimentally. Furthermore, we analyze a variant in which the AMF-technique has been used to really solve (‘until convergence’) the underlying Radau IIA method so that we can rely on its excellent stability and accuracy characteristics. Finally, the method has been tested on several examples. Also, a comparison has been made with the existing codes VODPK and IMEXRKC, and the efficiency (CPU time versus accuracy) is shown to be at least competitive with the efficiency of these solvers.     

On a least-squares collocation method for linear differential-algebraic equations

Summary The aim of this note is to extend some results on least-squares collocation methods and to prove the convergence of a least-squares collocation method applied to linear differential-algebraic equations. Some numerical examples are presented.     

Piecewise polynomial collocation for linear boundary value problems of fractional differential equations

We consider a class of boundary value problems for linear multi-term fractional differential equations which involve Caputo-type fractional derivatives. Using an integral equation reformulation of the boundary value problem, some regularity properties of the exact solution are derived. Based on these properties, the numerical solution of boundary value problems by piecewise polynomial collocation methods is discussed. In particular, we study the attainable order of convergence of proposed algorithms and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by two numerical examples.     

The collocation method for the solution of boundary integral equations

This article is devoted to investigating the approximate solutions to a class of boundary integral equations over a closed, bounded and smooth surface found via the collocation method. This article provides sufficient conditions for the convergence of this method in the space of continuous functions.     

An efficient computational method for linear fifth-order two-point boundary value problems

In this paper, we present a new algorithm to solve general linear fifth-order boundary value problems (BVPs) in the reproducing kernel space . Representation of the exact solution is given in the reproducing kernel space. Its approximate solution is obtained by truncating the n-term of the exact solution. Some examples are displayed to demonstrate the computational efficiency of the method.     

A transform method for linear evolution PDEs on a finite interval

We study initial boundary value problems for linear scalar evolutionpartial differential equations, with spatial derivatives ofarbitrary order, posed on the domain {t > 0, 0 < x <L}. We show that the solution can be expressed as an integralin the complex k-plane. This integral is defined in terms ofan x-transform of the initial condition and a t-transform ofthe boundary conditions. The derivation of this integral representationrelies on the analysis of the global relation, which is an algebraicrelation defined in the complex k-plane coupling all boundaryvalues of the solution. For particular cases, such as the case of periodic boundaryconditions, or the case of boundary value problems for even-orderPDEs, it is possible to obtain directly from the global relationan alternative representation for the solution, in the formof an infinite series. We stress, however, that there existinitial boundary value problems for which the only representationis an integral which cannot be written as an infinite series.An example of such a problem is provided by the linearized versionof the KdV equation. Similarly, in general the solution of odd-orderlinear initial boundary value problems on a finite intervalcannot be expressed in terms of an infinite series.