Abstract
Consider a general two-point boundary value problem (TPBVP): \[ \begin{gathered} y'(t) = f(t,y), \hfill \\ B_1 y(a) + B_2 y(b) = w,\quad \hfill \\ \end{gathered} a \leqq t \leqq b, \] where $f:R^{n + 1} \to R^n ,f \in C^2 ,B_1 $ and $B_2 $ are $n \times n$ matrices and $w \in R^n $. It is shown how one can bound a posteriori the error made in the numerical solution of the TPBVP. The error bounds obtained are rigorous and include the truncation and the roundoff error. In addition, the computations establish the existence of solutions to the TPBVP. Numerical schemes are developed for the case where $f(t,y)$ is a polynomial in t and y. Examples are given of computational existence proofs for problems where analytical existence proofs are not known.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.