A Collocation Code for Singular Boundary Value Problems in Ordinary Differential Equations

We present a MATLAB package for boundary value problems in ordinary differential equations. Our aim is the efficient numerical solution of systems of ODEs with a singularity of the first kind, but the solver can also be used for regular problems. The basic solution is computed using collocation methods and a new, efficient estimate of the global error is used for adaptive mesh selection. Here, we analyze some of the numerical aspects relevant for the implementation, describe measures to increase the efficiency of the code and compare its performance with the performance of established standard codes for boundary value problems.     

双比例延迟微分方程配置法的可达阶

近几十年来,随着延迟微分方程广泛应用于变最测试、信号传递、机械化工、生命科学及经济管理系统等实际中,人们对此类方程的数值计算要求越来越高．     

Pathfollowing for essentially singular boundary value problems with application to the complex Ginzburg-Landau equation

We present a pathfollowing strategy based on pseudo-arclength parametrization for the solution of parameter-dependent boundary value problems for ordinary differential equations. We formulate criteria which ensure the successful application of this method for the computation of solution branches with turning points for problems with an essential singularity. The advantages of our approach result from the possibility to use efficient mesh selection, and a favorable conditioning even for problems posed on a semi-infinite interval and subsequently transformed to an essentially singular problem. This is demonstrated by a Matlab implementation of the solution method based on an adaptive collocation scheme which is well suited to solve problems of practical relevance. As one example, we compute solution branches for the complex Ginzburg-Landau equation which start from non-monotone ‘multi-bump’ solutions of the nonlinear Schrödinger equation. Following the branches around turning points, real-valued solutions of the nonlinear Schrödinger equation can easily be computed.     

A hybrid collocation method for a nonlinear Volterra integral equation with weakly singular kernel

This work is concerned with the numerical solution of a nonlinear weakly singular Volterra integral equation. Owing to the singular behavior of the solution near the origin, the global convergence order of product integration and collocation methods is not optimal. In order to recover the optimal orders a hybrid collocation method is used which combines a non-polynomial approximation on the first subinterval followed by piecewise polynomial collocation on a graded mesh. Some numerical examples are presented which illustrate the theoretical results and the performance of the method. A comparison is made with the standard graded collocation method.     

An error analysis and the mesh independence principle for a nonlinear collocation problem

A nonlinear Dirichlet boundary value problem is approximated by an orthogonal spline collocation scheme using piecewise Hermite bicubic functions. Existence, local uniqueness, and error analysis of the collocation solution and convergence of Newton's method are studied. The mesh independence principle for the collocation problem is proved and used to develop an efficient multilevel solution method. Simple techniques are applied for estimating certain discretization and iteration constants that are used in the formulation of a mesh refinement strategy and an efficient multilevel method. Several mesh refinement strategies for solving a test problem are compared numerically. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Mesh selection for stiff two-point boundary value problems

This paper is concerned with the mesh selection algorithm of COLSYS, a well known collocation code for solving systems of boundary value problems. COLSYS was originally designed to solve non-stiff and mildly stiff problems only. In this paper we show that its performance for solving extremely stiff problems can be considerably improved by modifying its error estimation and mesh selection algorithms. Numerical examples indicate the superiority of the modified algorithm.Dedicated to John Butcher on the occasion of his sixtieth birthday     

A note on accurate estimations of the local truncation error of polynomial methods for differential equations

We give sharp error estimations for the local truncation error of polynomial methods for the approximate solution of initial value problems. Our analysis is developed for second order differential equations with polynomial coefficients using the Tau Method as an analytical tool. Our estimates apply to approximations derived with the latter, with collocation and with techniques based on series expansions. An example on collocation is given, to illustrate the use of our estimates.     

On the Effect of Boundary Conditions in Collocation by Polynomial Splines for the Solution of Boundary Value Problems in Ordinary Differential Equations

Consider the numerical solution of a boundary-value problemfor a differential equation of order m using collocation ofa polynomial spline of degree n m on a uniform mesh of sizeh. We describe several collocation schemes which differ onlyin the boundary collocation conditions and which include a "natural"spline collocation scheme. Taking account of derived asymptoticerror bounds most of which are, roughly speaking, of O(hn^12m+1), we discuss the computational effectiveness of the variousschemes.     

A Generalization of the Arnold-Wendland Lemma to a Modified Collocation Method for Boundary Integral Equations in ℝ3

We prove quasioptimal and optimal order estimates in various Sobolev norms for the approximation of linear strongly elliptic periodic pseudodifferential equations in two independent variables by a modified method of nodal collocation by odd degree polynomial splines. In the one-dimensional case, our method coincides with the method of nodal collocation when odd degree polynomial splines are employed for the trial functions. The convergence analysis is based on an equivalence which we establish between our method and a nonstandard Galerkin method for an operator closely related to the given operator. This equivalence is realized through a crucial intermediate result (which we now term the Arnold-Wendland lemma) to connect the solution of central finite difference equations and that of certain nonstandard Galerkin equations. The results of this paper are genuine two-dimensional generalizations of the results obtained by ARNOLD and WENDLAND in [2] for the one-dimensional equations.     

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.     

Convergence analysis for a second-order elliptic equation by a collocation method using scattered points

A collocation method using scattered points applied to a second-order elliptic differential equation is analyzed by establishing a new quadrature formula for the space of the polynomials. We show that a polynomial solution possesses stability and preserves a similar convergence property occurred in the classical high order collocation method.     

New a posteriori error estimates for singular boundary value problems

In this paper, we discuss the asymptotic properties and efficiency of several a posteriori estimates for the global error of collocation methods. Proofs of the asymptotic correctness are given for regular problems and for problems with a singularity of the first kind. We were also strongly interested in finding out which of our error estimates can be applied for the efficient solution of boundary value problems in ordinary differential equations with an essential singularity. Particularly, we compare estimates based on the defect correction principle with a strategy based on mesh halving. AMS subject classification 65L05Supported in part by the Austrian Research Fund (FWF) grant P-15072-MAT and SFB Aurora.     

Convergence properties of a class of boundary element approximations to linear diffusion problems with localized nonlinear reactions

We consider a boundary element (BE) Algorithm for solving linear diffusion desorption problems with localized nonlinear reactions. The proposed BE algorithm provides an elegant representation of the effect of localized nonlinear reactions, which enables the effects of arbitrarily oriented defect structures to be incorporated into BE models without having to perform severe mesh deformations. We propose a one-step recursion procedure to advance the BE solution of linear diffusion localized nonlinear reaction problems and investigate its convergence properties. The separation of the linear and nonlinear effects by the boundary integral formulation enables us to consider the convergence properties of approximations to the linear terms and nonlinear terms of the boundary integral equation separately. For the linear terms we investigate how the degree of piecewise polynomial collocation in space and the size of the spatial mesh relative to the time step affects the accumulation of errors in the one-step recursion scheme. We develop a novel convergence analysis that combines asymptotic methods with Lax's Equivalence Theorem. We identify a dimensionless meshing parameter θ whose magnitudé governs the performance of the one-step BE schemes. In particular, we show that piecewise constant (PWC) and piecewise linear (PWL) BE schemes are conditionally convergent, have lower asymptotic bounds placed on the size of time steps, and which display excess numerical diffusion when small time steps are used. There is no asymptotic bound on how large the tie steps can be–this allows the solution to be advanced in fewer, larger time steps. The piecewise quadratic (PWQ) BE scheme is shown to be unconditionally convergent; there is no asymptotic restriction on the relative sizes of the time and spatial meshing and no numerical diffusion. We verify the theoretical convergence properties in numerical examples. This analysis provides useful information about the appropriate degree of spatial piecewise polynomial and the meshing strategy for a given problem. For the nonlinear terms we investigate the convergence of an explicit algorithm to advance the solution at an active site forward in time by means of Caratheodory iteration combined with piecewise linear interpolation. We consider a model problem comprising a singular nonlinear Volterra equation that represents the effect of the term in the BE formulation that is due to a single defect. We prove the convergence of the piecewise linear Caratheodory iteration algorithm to a solution of the model problem for as long as such a solution can be shown to exist. This analysis provides a theoretical justification for the use of piecewise linear Caratheodory iterates for advancing the effects of localized reactions.     

Stability of piecewise polynomial collocation for computing periodic solutions of delay differential equations

Summary. We prove numerical stability of a class of piecewise polynomial collocation methods on nonuniform meshes for computing asymptotically stable and unstable periodic solutions of the linear delay differential equation by a (periodic) boundary value approach. This equation arises, e.g., in the study of the numerical stability of collocation methods for computing periodic solutions of nonlinear delay equations. We obtain convergence results for the standard collocation algorithm and for two variants. In particular, estimates of the difference between the collocation solution and the true solution are derived. For the standard collocation scheme the convergence results are “unconditional”, that is, they do not require mesh-ratio restrictions. Numerical results that support the theoretical findings are also given. Received June 9, 2000 / Revised version received December 14, 2000 / Published online October 17, 2001     

时滞积-微分方程配置解的多重校正

本文讨论线性Volterra时滞积一微分方程的连续分片多项式样条配置方法．在适当条件下,获得了配置解的导数在结点集上成立的精细误差展开式．以此为基础,给出了配置解的多重校正格式．     

A Hybrid Mesh Selection Strategy Based on Conditioning for Boundary Value ODE Problems

An appropriate mesh selection strategy is one of the fundamental tools in designing robust codes for differential problems, especially if the codes are required to work for difficult multi scale problems. Most of the existing codes base the mesh selection on an estimate of the error (or the residual). Our strategy, based on the estimation of two parameters characterising the conditioning of the continuous problem, as well as on an estimate of the error, not only permits us to obtain a well adapted mesh, thus reducing the cost of the code, but also provides a measure of the conditioning of both continuous and discrete problems.     

Geometric meshes in collocation methods for Volterra integral equations with proportional delays

In this paper we analyse the local superconvergence propertiesof iterated piecewise polynomial collocation solutions for linearsecond-kind Volterra integral equations with (vanishing) proportionaldelays qt (0 < q < 1). It is shown that on suitable geometricmeshes depending on q, collocation at the Gauss points leadsto almost optimal superconvergence at the mesh points. Thiscontrasts with collocation on uniform meshes where the problemregarding the attainable order of local superconvergence remainsopen.     

Parallel collocation solution of index-1 BVP-DAEs arising from constrained optimal control problems

The indirect solution of constrained optimal control problems gives rise to two-point boundary value problems (BVPs) that involve index-1 differential-algebraic equations (DAEs) and inequality constraints. This paper presents a parallel collocation algorithm for the solution of these inequality constrained index-1 BVP-DAEs. The numerical algorithm is based on approximating the DAEs using piecewise polynomials on a nonuniform mesh. The collocation method is realized by requiring that the BVP-DAE be satisfied at Lobatto points within each interval of the mesh. A Newton interior-point method is used to solve the collocation equations, and maintain feasibility of the inequality constraints. The implementation of the algorithm involves: (i) parallel evaluation of the collocation equations; (ii) parallel evaluation of the system Jacobian; and (iii) parallel solution of a boarded almost block diagonal (BABD) system to obtain the Newton search direction. Numerical examples show that the parallel implementation provides significant speedup when compared to a sequential version of the algorithm.     

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.     

The collocation method for mixed boundary value problems on domains with curved polygonal boundaries

Summary. We consider an indirect boundary integral equation formulation for the mixed Dirichlet-Neumann boundary value problem for the Laplace equation on a plane domain with a polygonal boundary. The resulting system of integral equations is solved by a collocation method which uses a mesh grading transformation and a cosine approximating space. The mesh grading transformation method yields fast convergence of the collocation solution by smoothing the singularities of the exact solution. A complete stability and solvability analysis of the transformed integral equations is given by use of a Mellin transform technique, in a setting in which each arc of the polygon has associated with it a periodic Sobolev space. Received April 15, 1995 / Revised version received April 10, 1996