Analysis of Carrier's problem
S. J. Chapman, P. E. Farrell

TL;DR
This paper combines computational and asymptotic methods to analyze Carrier's problem, revealing a complex bifurcation structure and providing a comprehensive classification of solutions that corrects previous claims.
Contribution
It introduces a novel asymptotic approach using Kuzmak's method to explain and predict the bifurcation structure of Carrier's problem.
Findings
Bifurcation diagram with infinite alternating pitchfork and fold bifurcations.
Asymptotic solutions accurately predict bifurcation points.
Complete taxonomy of solutions contradicting previous claims.
Abstract
A computational and asymptotic analysis of the solutions of Carrier's problem is presented. The computations reveal a striking and beautiful bifurcation diagram, with an infinite sequence of alternating pitchfork and fold bifurcations as the bifurcation parameter tends to zero. The method of Kuzmak is then applied to construct asymptotic solutions to the problem. This asymptotic approach explains the bifurcation structure identified numerically, and its predictions of the bifurcation points are in excellent agreement with the numerical results. The analysis yields a novel and complete taxonomy of the solutions to the problem, and demonstrates that a claim of Bender & Orszag is incorrect.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDifferential Equations and Numerical Methods · Probabilistic and Robust Engineering Design
