No label defined (Q4359804)

[For part I see \textit{T. Yamamoto}, Jap. J. Ind. Appl. Math. 14, No. 1, 87-97 (1997; Zbl 0881.65038); for part II see \textit{K. Ishihara}, \textit{Y. Muroya} and \textit{T. Yamamoto}, Jap. J. Ind. Appl. Math. 14, No. 1, 99-110 (1997; Zbl 0881.65041).] The authors consider successive overrelaxation (SOR)-secant methods and generalizations for problems of the form \(Av+\phi(v)= 0\). Here \(A\) is a positive definite matrix and \(\phi\) a nonlinear nondifferentiable mapping. In contrast to the title estimates are only obtained for the differentiable case. Numerical results for nonlinear boundary value problems show that a moderate number of iteration steps are sufficient for stepsize \(h=0.1\) while discretizations with \(h\leq 0.01\) lead to iterations with more than 400 steps. Reviewer's remark: For this reason variants of the conjugate gradient algorithm or multigrid methods are applied in actual computations with those problems.