170 |
ENDDO |
ENDDO |
171 |
C compute convergence criterion for linear preconditioned FGMRES |
C compute convergence criterion for linear preconditioned FGMRES |
172 |
JFNKgamma_lin = JFNKgamma_lin_max |
JFNKgamma_lin = JFNKgamma_lin_max |
173 |
IF ( newtonIter.GT.1.AND.newtonIter.LE.100 |
IF ( newtonIter.GT.1.AND.newtonIter.LE.SEAICE_JFNK_tolIter |
174 |
& .AND.JFNKresidual.LT.JFNKres_t ) THEN |
& .AND.JFNKresidual.LT.JFNKres_t ) THEN |
175 |
C Eisenstat, 1996, equ.(2.6) |
C Eisenstat, 1996, equ.(2.6) |
176 |
phi_e = 1. _d 0 |
phi_e = 1. _d 0 |
254 |
IF ( krylovIter.EQ.SEAICEkrylovIterMax ) THEN |
IF ( krylovIter.EQ.SEAICEkrylovIterMax ) THEN |
255 |
krylovFails = krylovFails + 1 |
krylovFails = krylovFails + 1 |
256 |
ENDIF |
ENDIF |
257 |
C Set the stopping criterion for the Newton iteration |
C Set the stopping criterion for the Newton iteration and the |
258 |
IF ( newtonIter .EQ. 1 ) JFNKtol=JFNKgamma_nonlin*JFNKresidual |
C criterion for the transition from accurate to approximate FGMRES |
259 |
|
IF ( newtonIter .EQ. 1 ) THEN |
260 |
|
JFNKtol=JFNKgamma_nonlin*JFNKresidual |
261 |
|
IF ( JFNKres_tFac .NE. UNSET_RL ) |
262 |
|
& JFNKres_t = JFNKresidual * JFNKres_tFac |
263 |
|
ENDIF |
264 |
C Update linear solution vector and return to Newton iteration |
C Update linear solution vector and return to Newton iteration |
265 |
C Do a linesearch if necessary, and compute a new residual. |
C Do a linesearch if necessary, and compute a new residual. |
266 |
C Note that it should be possible to do the following operations |
C Note that it should be possible to do the following operations |
479 |
facLS = 1. _d 0 |
facLS = 1. _d 0 |
480 |
doLineSearch = .TRUE. |
doLineSearch = .TRUE. |
481 |
DO WHILE ( doLineSearch ) |
DO WHILE ( doLineSearch ) |
|
C Determine, if we need more iterations |
|
|
doLineSearch = resLoc .GE. JFNKresidual |
|
|
C Limit the maximum number of iterations arbitrarily to four |
|
|
doLineSearch = doLineSearch .AND. l .LE. 4 |
|
|
C For the first iteration du/vIce = 0 and there will be no |
|
|
C improvement of the residual possible, so we do only the first |
|
|
C iteration |
|
|
IF ( newtonIter .EQ. 1 ) doLineSearch = .FALSE. |
|
|
C Only start a linesearch after some Newton iterations |
|
|
IF ( newtonIter .LE. SEAICE_JFNK_lsIter ) doLineSearch = .FALSE. |
|
|
C Increment counter |
|
|
l = l + 1 |
|
482 |
C Create update |
C Create update |
483 |
DO bj=myByLo(myThid),myByHi(myThid) |
DO bj=myByLo(myThid),myByHi(myThid) |
484 |
DO bi=myBxLo(myThid),myBxHi(myThid) |
DO bi=myBxLo(myThid),myBxHi(myThid) |
501 |
CALL SEAICE_MAP2VEC(nVec,uIceRes,vIceRes,resTmp,.TRUE.,myThid) |
CALL SEAICE_MAP2VEC(nVec,uIceRes,vIceRes,resTmp,.TRUE.,myThid) |
502 |
CALL SEAICE_SCALPROD(nVec,1,1,1,resTmp,resTmp,resLoc,myThid) |
CALL SEAICE_SCALPROD(nVec,1,1,1,resTmp,resTmp,resLoc,myThid) |
503 |
resLoc = SQRT(resLoc) |
resLoc = SQRT(resLoc) |
504 |
|
C Determine, if we need more iterations |
505 |
|
doLineSearch = resLoc .GE. JFNKresidual |
506 |
|
C Limit the maximum number of iterations arbitrarily to four |
507 |
|
doLineSearch = doLineSearch .AND. l .LT. 4 |
508 |
|
C For the first iteration du/vIce = 0 and there will be no |
509 |
|
C improvement of the residual possible, so we do only the first |
510 |
|
C iteration |
511 |
|
IF ( newtonIter .EQ. 1 ) doLineSearch = .FALSE. |
512 |
|
C Only start a linesearch after some Newton iterations |
513 |
|
IF ( newtonIter .LE. SEAICE_JFNK_lsIter ) doLineSearch = .FALSE. |
514 |
|
C Increment counter |
515 |
|
l = l + 1 |
516 |
C some output diagnostics |
C some output diagnostics |
517 |
IF ( debugLevel.GE.debLevA .AND. doLineSearch ) THEN |
IF ( debugLevel.GE.debLevA .AND. doLineSearch ) THEN |
518 |
_BEGIN_MASTER( myThid ) |
_BEGIN_MASTER( myThid ) |