Large-Scale Continuation and Numerical Bifurcation for Partial Differential Equations

Authors:
Bryan D. Davidson
Affiliations:
-
Venue:
SIAM Journal on Numerical Analysis
Year:
1997

Citing 0
Cited 4

A continuation BSOR-Lanczos-Galerkin method for positive bound states of a multi-component Bose-Einstein condensate

Journal of Computational Physics
Improvement of the recursive projection method for linear iterative scheme stabilization based on an approximate eigenvalue problem

Journal of Computational Physics
Letter to the editor: On the integral solution of the one-dimensional Bratu problem

Journal of Computational and Applied Mathematics
A simple solution of the Bratu problem

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.01

Visualization

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.