Fixed-point iterative procedures for solving nonlinear parameter dependent problems can converge for some interval of parameter values and diverge as the parameter changes. The Recursive Projection Method (RPM), which stabilizes such procedures by computing a projection onto the unstable subspace is presented. On this subspace a Newton or special Newton iteration is performed, and the fixed-point iteration is used on the complement. As continuation in the parameter proceeds, the projection is efficiently updated, possibly increasing or decreasing the dimension of the unstable subspace. The method is extremely effective when the dimension of the unstable subspace is small compared to the dimension of the system. Convergence proofs are given and pseudo-arclength continuation on the unstable subspace is introduced to allow continuation past folds. Examples are presented for an important application of the RPM in which a “black-box” time integration scheme is stabilized, enabling it to compute unstable steady states. The RPM can also be used to accelerate iterative procedures when slow convergence is due to a few slowly decaying modes.
[1]
C. T. Fike,et al.
Norms and exclusion theorems
,
1960
.
[2]
Gene H. Golub,et al.
Matrix computations
,
1983
.
[3]
W. Mackens,et al.
Solving large nonlinear systems of equations by an adaptive condensation process
,
1986
.
[4]
H. Jarausch,et al.
Computing Bifurcation Diagrams for Large Nonlinear Variational Problems
,
1987
.
[5]
H. Keller.
Lectures on Numerical Methods in Bifurcation Problems
,
1988
.
[6]
H. Kreiss,et al.
Method of lines for hyperbolic differential equations
,
1992
.