-
Notifications
You must be signed in to change notification settings - Fork 3
/
new_time.f90
178 lines (146 loc) · 5.29 KB
/
new_time.f90
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
! BSD 2-Clause License
!
! Copyright (c) [2019] [Valeria Barra]
! All rights reserved.
!
! Redistribution and use in source and binary forms, with or without
! modification, are permitted provided that the following conditions are met:
!
! 1. Redistributions of source code must retain the above copyright notice, this
! list of conditions and the following disclaimer.
!
! 2. Redistributions in binary form must reproduce the above copyright notice,
! this list of conditions and the following disclaimer in the documentation
! and/or other materials provided with the distribution.
!
! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
! ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
! WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
! DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
! ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
! (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
! LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
! ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
! (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
! SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
SUBROUTINE new_time(res,resold,dt,Qi,Ri,newton_iter,stab_iter,massold,massinit,mass_flag,tau_21)
USE nrtype
USE domain_space, ONLY: n, nmmax
USE domain_time
USE paras, ONLY: fac_dec, dt_min, percent, folder, tolmass, dx
IMPLICIT NONE
!!$ This subroutine allows us to advance in time.
!!$ It solves for the next time step, using Newton's iteration.
!!$
!!$ Input:
!!$ res: solution at t=t_n
!!$ dt: trial time step
!!$
!!$ Output:
!!$ res: solution at t=t_{n+1}
!!$ dt: time step from t_n to t_{n+1}
!!$ newton_iter: number of newton's iteration
INTERFACE
SUBROUTINE newton(res_guess,Qi, Ri,Qinew,Rinew,resold,dt,newton_iter,iflag_newton,tau_21)
USE nrtype
USE nr_ban
USE domain_time
USE domain_space, ONLY: n, nmmax
USE paras
USE vanderwaals
USE mobility
IMPLICIT NONE
REAL(DP), DIMENSION(nmmax), INTENT(INOUT) :: res_guess
REAL(DP), DIMENSION(n), INTENT(INOUT) :: tau_21
REAL(DP), DIMENSION(nmmax), INTENT(IN) :: Qi, Ri,resold
REAL(DP), DIMENSION(nmmax), INTENT(INOUT) :: Qinew, Rinew
REAL(DP), INTENT(IN) :: dt
INTEGER(I4B), INTENT(OUT) :: newton_iter,iflag_newton
END SUBROUTINE newton
END INTERFACE
REAL(DP), DIMENSION(nmmax), INTENT(INOUT) :: res, resold
REAL(DP), DIMENSION(nmmax), INTENT(INOUT) :: Qi, Ri
REAL(DP), DIMENSION(n), INTENT(INOUT) :: tau_21
REAL(DP), INTENT(INOUT) :: dt
INTEGER(I4B), INTENT(OUT) :: newton_iter
INTEGER(I4B), INTENT(INOUT) :: stab_iter
REAL(DP), INTENT(INOUT) :: massold
REAL(DP), INTENT(IN) :: massinit
INTEGER(I4B), INTENT(INOUT) :: mass_flag
REAL(DP) :: res_guess(nmmax),Qinew(nmmax),Rinew(nmmax)
INTEGER(I4B) :: iflag_newton,k
REAL(DP) :: diff_min
REAL(DP) :: massnew, massdiff, massdiffold, massdiffnew
!!$ Guess for t_{n+1}
res_guess(1:n)=res(1:n)
iflag_newton=1
DO WHILE (iflag_newton.EQ.1)
iflag_newton=0
newton_iter=1
CALL newton(res_guess,Qi, Ri,Qinew,Rinew,resold,dt,newton_iter,iflag_newton,tau_21)
diff_min=DABS(MINVAL(res_guess(1:n))-MINVAL(resold(1:n)))
IF(iflag_newton.EQ.1)THEN
res_guess(1:n)=res(1:n)
dt=dt/fac_dec
stab_iter=0
IF(dt.LE.dt_min)THEN
WRITE(6,*)'Min. time step reached, dt=', dt
OPEN(9,FILE=folder//'resMindt.dat')
DO k=1,n
WRITE(9,101)res(k)
END DO
CALL FLUSH(9)
STOP
END IF
! IF((diff_min.GE.percent))THEN !case of insuccess
! res_guess(1:n)=res(1:n)
! dt=dt/fac_dec
! WRITE(6,99)'H diminished too much, diffmin=', diff_min
! stab_iter=0
! IF(dt.LE.dt_min)THEN
! WRITE(6,*)'Min. time step reached, dt=', dt
! OPEN(9,FILE=folder//'resMindt.dat')
! DO k=1,n
! WRITE(9,101)res(k)
! END DO
! CALL FLUSH(9)
! STOP
! END IF
! END IF
END IF
END DO
! Check for mass loss !
massnew=SUM(res_guess(1:n))*dx
massdiffold=(massinit-massold)/massinit
massdiffnew=(massinit-massnew)/massinit
massdiff=DABS(massnew-massold)/dt
! massdiff=DABS(massdiffold-massdiffnew)/dt
IF(massdiff.GE.tolmass)THEN
dt=dt/fac_dec
WRITE(6,99)'Mass loss too big=',massdiff, 'dt=', dt
mass_flag = 1
IF(dt.LE.dt_min)THEN
WRITE(6,*)'Min. time step reached, dt=', dt
OPEN(9,FILE=folder//'resMindt.dat')
DO k=1,n
WRITE(9,101)res(k)
END DO
CALL FLUSH(9)
STOP
END IF
ELSE ! this is the part that all went well
stab_iter=stab_iter+1
!!$ Newton converged !!$ So we update all the variables
resold(1:n)= res(1:n)
res(1:n)=res_guess(1:n)
Qi(1:n)=Qinew(1:n)
Ri(1:n)=Rinew(1:n)
! update the mass now
massold=massnew
!!$
mass_flag = 0
END IF
101 FORMAT(ES25.15)
99 FORMAT(A28,ES19.10,A15,ES11.2)
RETURN
END SUBROUTINE new_time