An Efficient Technique for the Computation of Stable Bifurcation Branches

DOI10.1137/0905025zbMath0575.65047OpenAlexW2012404336MaRDI QIDQ3694557

Helmut Weber

Publication date: 1984

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0905025

zbMATH Keywords

stabilitynumerical examplesConvergencenonlinear eigenvalue problemsmulti-grid methodsbifurcation pointbifurcation branchnonlinear elliptic eigenvalue problemselective Picard iteration

Mathematics Subject Classification ID

Nonlinear eigenvalue problems and nonlinear spectral theory for PDEs (35P30) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Related Items (3)

Path following around corank-2 bifurcation points of a semi-linear elliptic problem with symmetry ⋮ A cubic Hermite finite element-continuation method for numerical solutions of the von Kármán equations ⋮ SYMMETRY REDUCTIONS AND A POSTERIORI FINITE ELEMENT ERROR ESTIMATORS FOR BIFURCATION PROBLEMS

This page was built for publication: An Efficient Technique for the Computation of Stable Bifurcation Branches