Please note, due to scheduled maintenance online transactions will not be possible between 07:00 - 10:00 GMT, on Thursday 21st March (03:00-06:00 EDT, 21 March, 2019). We apologise for any inconvenience.
The Douglas–Rachford method has been employed successfully to solve many kinds of nonconvex feasibility problems. In particular, recent research has shown surprising stability for the method when it is applied to finding the intersections of hypersurfaces. Motivated by these discoveries, we reformulate a second order boundary value problem (BVP) as a feasibility problem where the sets are hypersurfaces. We show that such a problem may always be reformulated as a feasibility problem on no more than three sets and is well suited to parallelization. We explore the stability of the method by applying it to several BVPs, including cases where the traditional Newton’s method fails.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.