An Efficient Technique for the Computation of Stable Bifurcation Branches
Hans Weber · SIAM Journal on Scientific and Statistical Computing · 1984
This paper deals with an application of the multi-grid iteration for large sparse linear systems to the problem of computing stable branches of solutions of nonlinear eigenvalue problems which bifurcate from simple eigenvalues. The theoretical background of the algorithm considered here is the selective Picard iteration. We present numerical results for difference approximations of nonlinear elliptic eigenvalue problems in one and two space dimensions. They confirm the efficiency of the algorithm proposed here.