|
||
it is a combination of two method which combines benefits of both Newton-Raphson and Picard method; . It means several first iterations are done by Picard, after that N-R continues. The number of Picard iteration is set in solver setup.
Note : This method requires that a 1D member is divided to at least four (4) finite elements. Usually, such division is adjusted automatically whenever Picard method is selected for calculation.