A new mesh selection algorithm, based on conditioning, for two-point boundary value codes

Authors:
J. R. Cash;F. Mazzia
Affiliations:
Department of Mathematics, Imperial College, South Kensington, London, England, UK;Dipartimento di Matematica, via Orabona, Bari, Italy
Venue:
Journal of Computational and Applied Mathematics
Year:
2005

Citing 8
Cited 2

A deferred correction method for nonlinear two-point boundary value problems: implementation and numerical evaluation

SIAM Journal on Scientific and Statistical Computing
FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation

ACM Transactions on Mathematical Software (TOMS)
An automatic continuation strategy for the solution of singularly perturbed linear two-point boundary value problems

Journal of Computational Physics
Runge-Kutta Software with Defect Control four Boundary Value ODEs

SIAM Journal on Scientific Computing
A new mesh selection strategy for ODEs

Applied Numerical Mathematics
A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra

SIAM Journal on Matrix Analysis and Applications
Numerical approximation of nonlinear BVPs by means of BVMs

Applied Numerical Mathematics
COLSYS - - A Collocation Code for Boundary - Value Problems

Proceedings of a Working Conference on Codes for Boundary-Value Problems in Ordinary Differential Equations

On the development of effective algorithms for the numerical solution of singularly perturbed two-point boundary value problems

International Journal of Computing Science and Mathematics
py_bvp: a universal Python interface for BVP codes

SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference

Quantified Score

Hi-index	7.29

Visualization

Abstract

We present a hybrid mesh selection strategy for use in codes for the numerical solution of two-point boundary value problems. This new mesh strategy is based on the estimation of two parameters which characterise the conditioning of the continuous problem as well as on a standard estimate of the local discretisation error. We have implemented this algorithm in the well known code TWPBVP and have found that the modified code is often considerably more efficient than the original. Another strong advantage of using the new mesh selection algorithm is that it automatically provides an estimate of the conditioning of the discrete problem. This is very valuable (arguably indispensible) for use either in an a posteriori error estimate or, in situations where the conditioning constants are large, as a warning that the accuracy obtained in the solution may be worse than anticipated.