posted on 2024-11-02, 18:42authored byJonathan Borwein, Scott Lindstrom, Brailey Sims, Anna Schneider, Matthew SkerrittMatthew Skerritt
We expand upon previous work that examined the behavior of the iterated Douglas-Rachford method for a line and a circle by considering two generalizations:that of a line and an ellipse and that of a line together with a p-sphere. With computer assistance we discover a beautiful geometry that illustrates phenomena which may affect the behavior of the iterates by slowing or inhibiting convergence for feasible cases. We prove local convergence near feasible points, and—seeking a better understanding of the behavior—we employ parallelization in order to study behavior graphically. Motivated by the computer-assisted discoveries, we prove a result about behavior of the method in infeasible cases.