On the reduction of Holt's problem to a finite interval

Linear boundary value problems for ordinary differential equations (34B05) Special ordinary differential equations (Mathieu, Hill, Bessel, etc.) (34B30) Numerical solution of boundary value problems involving ordinary differential equations (65L10)

Review text

Holt's problem: \(x-p(t)x=0\), \(0<t<\infty\), \(x(0)=b\), \(x(\infty)=0\), \(p(t)=t^ 2(1+p_ 0t^ 2)\), \(p_ 0=2m+1\), m nonnegative integer, is solved using Abramov's variant of the ``chasing (or ``factorization or ``sweeping) method, replacing the infinite interval by \(0<t<T\), and the condition \(x(\infty)=0\) by \(x'(t^*)-t^*{\tilde \alpha}(t^*)x(t^*)=0,\) \(0<t^*<T\). This condition appears instead of the usual one: \(x'(T)-T\alpha (T)x(T)=0,\) \({\tilde \alpha}\)(t) being an approximation of \(\alpha\) (t). The method seems advantageous when a small interval \([0,t^*]\) is used. The authors construct an error estimate for both reductions.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: On the reduction of Holt's problem to a finite interval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579865)