Abstract
In this paper the problem of computing bifurcation diagrams for large-scale nonlinear parameter-dependent steady state systems which arise following the spatial discretization of semilinear PDEs is investigated. A continuation algorithm which employs a preconditioned version of the recursive projection method (RPM) is presented. The RPM is often expensive when it is used in conjunction with the numerical method of lines. Preconditioning the Jacobian of the underlying fixed point operator results in an algorithm (the preconditioned recursive projection method (PRPM)) which is capable of efficiently computing equilibrium solution diagrams of large stiff systems. For many PDE problems the PRPM is a fast and effective means of detecting both steady state and Hopf bifurcation along a branch of solutions. A description of the performance of the PRPM when applied to two numerical examples is given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
