Rational collocation for linear boundary value problems (Q753441): Difference between revisions

The paper describes a rational collocation algorithm based on cubic splines approximations for linear two-point boundary value problems (BVPs). The zeros of Legendre polynomials are chosen as the knots for collocation. The denominators of the rational collocation are fixed. It is shown that under certain restriction on the problem, the rational collocation for a given BVP is equivalent to solving an associated BVP by polynomial collocation. The proposed algorithm is shown to be effective for some singularly perturbed problems.