@Article{JCM-19-583,
author = {Sheng , Song-Bai and Xu , Hui-Fu},
title = {Picard Iteration for Nonsmooth Equations},
journal = {Journal of Computational Mathematics},
year = {2001},
volume = {19},
number = {6},
pages = {583--590},
abstract = {<p style="text-align: justify;">This paper presents an analysis of the generalized Newton method, approximate Newton methods, and splitting methods for solving nonsmooth equations from Picard iteration viewpoint. It is proved that the radius of the weak Jacobian (RGJ) of Picard iteration function is equal to its least Lipschitz constant. Linear convergence or superlinear convergence results can be obtained provided that RGJ of the Picard iteration function at a solution point is less than one or equal to zero. As for applications, it is pointed out that the approximate Newton methods, the generalized Newton method for piecewise $C^1$ problems and splitting methods can be explained uniformly with the same viewpoint. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/9010.html}
}