-
Notifications
You must be signed in to change notification settings - Fork 0
/
interp_functions.f90
610 lines (608 loc) · 20.3 KB
/
interp_functions.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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
MODULE interp_functions
!
USE def_variables
USE def_constants
IMPLICIT NONE
PRIVATE
PUBLIC :: Lin_int_Left_Low ,Lin_int_Left_High,Lin_int_Log10,&
& Lin_TP_Log10,Lin_TP,Lin_int
!
!
CONTAINS
!
! ===================================================================
!
! Lin_int_Left_Low
!
! ===================================================================
!
! It receives as input a couple of values (u_in, v_in),
! identifies the cell of the grid within the point is, and, finally,
! evaluates properties using the matrices already computed, by using
! a bilinear interpolation between the vertices of the cell.
!
! * Lin_int_Left_Low - linear scaling transformation and spline
! coefficients "linearly" determined
! ===================================================================
SUBROUTINE Lin_int_Left_Low(T_out, p_out, c_out, u_in, v_in)
!
! Global Variables
REAL(pr), INTENT(OUT) :: T_out, p_out, c_out
REAL(pr), INTENT(IN) :: u_in, v_in
!
! Local Variables
INTEGER :: i, j
REAL(pr) :: x_mesh_test, delta_u, delta_v, v_min_li, v_max_li,v_max_li_log, &
& T_down_left, T_down_right, T_up_left, T_up_right, &
& p_down_left, p_down_right, p_up_left, p_up_right, &
& c_down_left, c_down_right, c_up_left, c_up_right, &
& DEN, A, B, D, E
!
! to identify the cell within the test-point is:
!
delta_u = y_mesh_LL(2) - y_mesh_LL(1)
i = INT((u_in - y_mesh_LL(1))/delta_u) + 1
!
! once that the interval on the vertical axis has been identified,
! it is possible to know the spline coefficients associated to it.
! By simply using them it is possible to evaluate the v_min_li
! (related to the pmax curve) and the v_max_li
! (related to the sat curve) for that u_in:
!
v_min_li = 0_pr
v_max_li = 0_pr
v_max_li_log = 0_pr
!
!
DO j = 1, ord_spline + 1
v_min_li = v_min_li + spline_pmax_LL(ord_spline+2-j,i) * u_in**(j-1)
!Evaluate Vmin e Vmax, on the row i(high already identified)
v_max_li = v_max_li + spline_Lsat_LL(ord_spline+2-j,i) * u_in**(j-1)
! v_max_li_log = v_max_li_log + spline_Lsat_LL(ord_spline+2-j,i) * u_in**(j-1)
! v_max_li = 10_pr ** v_max_li_log
!Approximated through the spline
ENDDO
!
! Evaluation of x_mesh_test: Lin_int_Left_Low
! We have the X to identify
x_mesh_test = ((x_mesh_LL(MMM_LL) - x_mesh_LL(1)) / &
& (v_max_li - v_min_li)) * (v_in - v_min_li) + x_mesh_LL(1)
!x_mesh_test = ((x_mesh_LL(MMM_LL) - x_mesh_LL(1)) / (LOG10(v_max_li) - LOG10(v_min_li)))&
!&* (LOG10(v_in) - LOG10(v_min_li)) + x_mesh_LL(1)
!
! to identify the interval on the horizontal axis
delta_v = x_mesh_LL(2) - x_mesh_LL(1)
j = INT((x_mesh_test - x_mesh_LL(1))/delta_v) + 1 !X of the cell identified
!
! once that the cell has been identified,
! it is possible to evaluate properties at the vertices:
T_down_left = TTT_LL(i,j)
T_down_right = TTT_LL(i,j+1)
T_up_left = TTT_LL(i+1,j)
T_up_right = TTT_LL(i+1,j+1)
!
p_down_left = ppp_LL(i,j)
p_down_right = ppp_LL(i,j+1)
p_up_left = ppp_LL(i+1,j)
p_up_right = ppp_LL(i+1,j+1)
!
c_down_left = ccc_LL(i,j)
c_down_right = ccc_LL(i,j+1)
c_up_left = ccc_LL(i+1,j)
c_up_right = ccc_LL(i+1,j+1)
!
! Bilinear Interpolation:
!
DEN = (x_mesh_LL(j+1)- x_mesh_LL(j))*(y_mesh_LL(i)- y_mesh_LL(i+1))
A = (x_mesh_LL(j+1)- x_mesh_test) *(y_mesh_LL(i)- u_in)
B = (x_mesh_test - x_mesh_LL(j))*(y_mesh_LL(i)- u_in)
D = (x_mesh_LL(j+1)- x_mesh_test) *(u_in - y_mesh_LL(i+1))
E = (x_mesh_test - x_mesh_LL(j))*(u_in - y_mesh_LL(i+1))
!
T_out = (A/DEN) * T_up_left + (B/DEN) * T_up_right + (D/DEN) * T_down_left + &
& (E/DEN) * T_down_right
!
p_out = (A/DEN) * p_up_left + (B/DEN) * p_up_right + (D/DEN) * p_down_left + &
& (E/DEN) * p_down_right
!
c_out = (A/DEN) * c_up_left + (B/DEN) * c_up_right + (D/DEN) * c_down_left + &
& (E/DEN) * c_down_right
!
END SUBROUTINE Lin_int_Left_Low
!
!
! ===================================================================
!
! Lin_int_Left_High
!
! ===================================================================
!
! It receives as input a couple of values (u_in, v_in),
! identifies the cell of the grid within the point is, and, finally,
! evaluates properties using the matrices already computed, by using
! a bilinear interpolation between the vertices of the cell.
!
! * Lin_int_Left_High - linear scaling transformation and spline
! coefficients "logaritmically" determined
! at the saturation
! ===================================================================
SUBROUTINE Lin_int_Left_High(T_out, p_out, c_out, u_in, v_in)
!
!
! Global Variables
REAL(pr), INTENT(OUT) :: T_out, p_out, c_out
REAL(pr), INTENT(IN) :: u_in, v_in
!
! Local Variables
INTEGER :: i, j
REAL(pr) :: x_mesh_test, delta_u, delta_v, v_min_li, v_max_li, v_max_li_log, &
& T_down_left, T_down_right, T_up_left, T_up_right, &
& p_down_left, p_down_right, p_up_left, p_up_right, &
& c_down_left, c_down_right, c_up_left, c_up_right, &
& DEN, A, B, D, E
!
!
! to identify the cell within the test-point is:
!
delta_u = y_mesh_LH(2) - y_mesh_LH(1)
i = INT((u_in - y_mesh_LH(1))/delta_u) + 1
!
! Initialization of v_min_li and v_max_li
v_min_li = 0_pr
v_max_li = 0_pr
v_max_li_log = 0_pr
!
DO j = 1, ord_spline + 1
v_min_li = v_min_li + spline_pmax_LH(ord_spline+2-j,i) * u_in**(j-1)
v_max_li = v_max_li + spline_Lsat_LH(ord_spline+2-j,i) * u_in**(j-1)
! v_max_li_log = v_max_li_log + spline_Lsat_LH(ord_spline+2-j,i) * u_in**(j-1)
! v_max_li = 10_pr ** v_max_li_log
ENDDO
!
! Evaluation of x_mesh_test:
! In the middle of the LH region v is discretized logarithmic
x_mesh_test = ((x_mesh_LH(MMM_LH) - x_mesh_LH(1)) / (LOG10(v_max_li) - LOG10(v_min_li)))&
&* (LOG10(v_in) - LOG10(v_min_li)) + x_mesh_LH(1)
!x_mesh_test = ((x_mesh_LH(MMM_LH) - x_mesh_LH(1)) / &
!& (v_max_li - v_min_li)) * (v_in - v_min_li) + x_mesh_LH(1)
!
! to identify the interval on the horizontal axis
delta_v = x_mesh_LH(2) - x_mesh_LH(1)
j = INT((x_mesh_test - x_mesh_LH(1))/delta_v) + 1
!
! once that the cell has been identified,it is possible to evaluate properties at the vertices:
T_down_left = TTT_LH(i,j)
T_down_right = TTT_LH(i,j+1)
T_up_left = TTT_LH(i+1,j)
T_up_right = TTT_LH(i+1,j+1)
!
p_down_left = ppp_LH(i,j)
p_down_right = ppp_LH(i,j+1)
p_up_left = ppp_LH(i+1,j)
p_up_right = ppp_LH(i+1,j+1)
!
c_down_left = ccc_LH(i,j)
c_down_right = ccc_LH(i,j+1)
c_up_left = ccc_LH(i+1,j)
c_up_right = ccc_LH(i+1,j+1)
!
! Bilinear Interpolation:
!
DEN = (x_mesh_LH(j+1)- x_mesh_LH(j))* (y_mesh_LH(i)- y_mesh_LH(i+1))
A = (x_mesh_LH(j+1)- x_mesh_test) * (y_mesh_LH(i)- u_in)
B = (x_mesh_test - x_mesh_LH(j))* (y_mesh_LH(i)- u_in)
D = (x_mesh_LH(j+1)- x_mesh_test) * (u_in - y_mesh_LH(i+1))
E = (x_mesh_test - x_mesh_LH(j))* (u_in - y_mesh_LH(i+1))
!
T_out = (A/DEN) * T_up_left + (B/DEN) * T_up_right + (D/DEN) * T_down_left + &
& (E/DEN) * T_down_right
!
p_out = (A/DEN) * p_up_left + (B/DEN) * p_up_right + (D/DEN) * p_down_left + &
& (E/DEN) * p_down_right
!
c_out = (A/DEN) * c_up_left + (B/DEN) * c_up_right + (D/DEN) * c_down_left + &
& (E/DEN) * c_down_right
!
END SUBROUTINE Lin_int_Left_High
!
!
!
! ===================================================================
!
! Lin_int_Log10
!
! ===================================================================
!
! It receives as input a couple of values (u_in, v_in),
! identifies the cell of the grid within the point is, and, finally,
! evaluates properties using the matrices already computed, by using
! a bilinear interpolation between the vertices of the cell.
!
! * Lin_int_Log10 - log scaling transformation
! note : 23/23/2017 not log scaling any more
! ===================================================================
!
SUBROUTINE Lin_int_Log10(T_out, p_out, c_out, u_in, v_in, NNN, MMM, x_mesh,&
&y_mesh, spline_pmin, spline_Vsat, TTT, ppp, ccc)
!
! Global Variables
REAL(pr), INTENT(OUT) :: T_out, p_out, c_out
REAL(pr), INTENT(IN) :: u_in, v_in
INTEGER, INTENT(IN) :: NNN, MMM
REAL(pr), DIMENSION(NNN), INTENT(IN) :: y_mesh
REAL(pr), DIMENSION(MMM), INTENT(IN) :: x_mesh
REAL(pr), DIMENSION(ord_spline+1,NNN-1), INTENT(IN) :: spline_pmin, spline_Vsat
REAL(pr), DIMENSION(NNN,MMM), INTENT(IN) :: TTT, ppp, ccc
!
! Local Variables
INTEGER :: i, j
REAL(pr) :: x_mesh_test, delta_u, delta_v, v_min_li, v_max_li, &
& T_down_left, T_down_right, T_up_left, T_up_right, &
& p_down_left, p_down_right, p_up_left, p_up_right, &
& c_down_left, c_down_right, c_up_left, c_up_right, &
& DEN, A, B, D, E
!
! to identify the cell within the test-point is:
!
delta_u = y_mesh(2) - y_mesh(1)
i = INT((u_in - y_mesh(1))/delta_u) + 1 ! to identify the interval on the vertical axis
!
! Initialization of v_min_li and v_max_li
v_min_li = 0_pr
v_max_li = 0_pr
!
DO j = 1, ord_spline + 1
v_min_li = v_min_li + spline_Vsat(ord_spline+2-j,i) * u_in**(j-1)
v_max_li = v_max_li + spline_pmin(ord_spline+2-j,i) * u_in**(j-1)
ENDDO
!
! Evaluation of x_mesh_test:
!
x_mesh_test = ((x_mesh(MMM) - x_mesh(1)) / (LOG10(v_max_li) - LOG10(v_min_li)))&
&* (LOG10(v_in) - LOG10(v_min_li)) + x_mesh(1)
!
!x_mesh_test = ((x_mesh(MMM) - x_mesh(1)) / (v_max_li - v_min_li))&
!&* (v_in - v_min_li) + x_mesh(1)
!
delta_v = x_mesh(2) - x_mesh(1)
j = INT((x_mesh_test - x_mesh(1))/delta_v) + 1 ! to identify the interval on the horizontal axis
!
!
! once that the cell has been identified,
! it is possible to evaluate properties at the vertices:
!
T_down_left = TTT(i,j)
T_down_right = TTT(i,j+1)
T_up_left = TTT(i+1,j)
T_up_right = TTT(i+1,j+1)
!
p_down_left = ppp(i,j)
p_down_right = ppp(i,j+1)
p_up_left = ppp(i+1,j)
p_up_right = ppp(i+1,j+1)
!
c_down_left = ccc(i,j)
c_down_right = ccc(i,j+1)
c_up_left = ccc(i+1,j)
c_up_right = ccc(i+1,j+1)
!
! Bilinear Interpolation:
!
DEN = (x_mesh(j+1) - x_mesh(j)) * (y_mesh(i) - y_mesh(i+1))
A = (x_mesh(j+1) - x_mesh_test) * (y_mesh(i) - u_in)
B = (x_mesh_test - x_mesh(j)) * (y_mesh(i) - u_in)
D = (x_mesh(j+1) - x_mesh_test) * (u_in - y_mesh(i+1))
E = (x_mesh_test - x_mesh(j)) * (u_in - y_mesh(i+1))
!
T_out = (A/DEN) * T_up_left + (B/DEN) * T_up_right + (D/DEN) * T_down_left + &
& (E/DEN) * T_down_right
!
p_out = (A/DEN) * p_up_left + (B/DEN) * p_up_right + (D/DEN) * p_down_left + &
& (E/DEN) * p_down_right
!
c_out = (A/DEN) * c_up_left + (B/DEN) * c_up_right + (D/DEN) * c_down_left + &
& (E/DEN) * c_down_right
!
END SUBROUTINE Lin_int_Log10
!
!=============================================================================
!
!Bilinear_interp
!
!============================================================================
SUBROUTINE Lin_int(T_out, p_out, c_out, u_in, v_in, NNN, MMM, x_mesh,&
&y_mesh, spline_pmin, spline_Vsat, TTT, ppp, ccc)
!
! Global Variables
REAL(pr), INTENT(OUT) :: T_out, p_out, c_out
REAL(pr), INTENT(IN) :: u_in, v_in
INTEGER, INTENT(IN) :: NNN, MMM
REAL(pr), DIMENSION(NNN), INTENT(IN) :: y_mesh
REAL(pr), DIMENSION(MMM), INTENT(IN) :: x_mesh
REAL(pr), DIMENSION(ord_spline+1,NNN-1), INTENT(IN) :: spline_pmin, spline_Vsat
REAL(pr), DIMENSION(NNN,MMM), INTENT(IN) :: TTT, ppp, ccc
!
! Local Variables
INTEGER :: i, j
REAL(pr) :: x_mesh_test, delta_u, delta_v, v_min_li, v_max_li, &
& T_down_left, T_down_right, T_up_left, T_up_right, &
& p_down_left, p_down_right, p_up_left, p_up_right, &
& c_down_left, c_down_right, c_up_left, c_up_right, &
& DEN, A, B, D, E
!
! to identify the cell within the test-point is:
!
delta_u = y_mesh(2) - y_mesh(1)
i = INT((u_in - y_mesh(1))/delta_u) + 1 ! to identify the interval on the vertical axis
!
! Initialization of v_min_li and v_max_li
v_min_li = 0_pr
v_max_li = 0_pr
!
DO j = 1, ord_spline + 1
v_min_li = v_min_li + spline_Vsat(ord_spline+2-j,i) * u_in**(j-1)
v_max_li = v_max_li + spline_pmin(ord_spline+2-j,i) * u_in**(j-1)
ENDDO
!
! Evaluation of x_mesh_test:
!
!
x_mesh_test = ((x_mesh(MMM) - x_mesh(1)) / (v_max_li - v_min_li))&
&* (v_in - v_min_li) + x_mesh(1)
!
delta_v = x_mesh(2) - x_mesh(1)
j = INT((x_mesh_test - x_mesh(1))/delta_v) + 1 ! to identify the interval on the horizontal axis
!
!
! once that the cell has been identified,
! it is possible to evaluate properties at the vertices:
!
T_down_left = TTT(i,j)
T_down_right = TTT(i,j+1)
T_up_left = TTT(i+1,j)
T_up_right = TTT(i+1,j+1)
!
p_down_left = ppp(i,j)
p_down_right = ppp(i,j+1)
p_up_left = ppp(i+1,j)
p_up_right = ppp(i+1,j+1)
!
c_down_left = ccc(i,j)
c_down_right = ccc(i,j+1)
c_up_left = ccc(i+1,j)
c_up_right = ccc(i+1,j+1)
!
! Bilinear Interpolation:
!
DEN = (x_mesh(j+1) - x_mesh(j)) * (y_mesh(i) - y_mesh(i+1))
A = (x_mesh(j+1) - x_mesh_test) * (y_mesh(i) - u_in)
B = (x_mesh_test - x_mesh(j)) * (y_mesh(i) - u_in)
D = (x_mesh(j+1) - x_mesh_test) * (u_in - y_mesh(i+1))
E = (x_mesh_test - x_mesh(j)) * (u_in - y_mesh(i+1))
!
T_out = (A/DEN) * T_up_left + (B/DEN) * T_up_right + (D/DEN) * T_down_left + &
& (E/DEN) * T_down_right
!
p_out = (A/DEN) * p_up_left + (B/DEN) * p_up_right + (D/DEN) * p_down_left + &
& (E/DEN) * p_down_right
!
c_out = (A/DEN) * c_up_left + (B/DEN) * c_up_right + (D/DEN) * c_down_left + &
& (E/DEN) * c_down_right
!
END SUBROUTINE Lin_int
! ===================================================================
!
! Bilinear_interp_Log10_TP
!
! ===================================================================
!
! It receives as input a couple of values (u_in, v_in),
! identifies the cell of the grid within the point is, and, finally,
! evaluates properties using the matrices already computed, by using
! a bilinear interpolation between the vertices of the cell.
!
! * Lin_int_Log10 - log scaling transformation
! BUG: v_in ~ vsat => j=0 but 1<j<100
! ===================================================================
!
SUBROUTINE Lin_TP_Log10(T_out, p_out, c_out, x_out, u_in, v_in, NNN, MMM, x_mesh,&
&y_mesh, spline_pmin, spline_Vsat, TTT, ppp, ccc, xxx)
!
! Global Variables
REAL(pr), INTENT(OUT) :: T_out, p_out, c_out, x_out
REAL(pr), INTENT(IN) :: u_in, v_in
INTEGER, INTENT(IN) :: NNN, MMM
REAL(pr), DIMENSION(NNN), INTENT(IN) :: y_mesh
REAL(pr), DIMENSION(MMM), INTENT(IN) :: x_mesh
REAL(pr), DIMENSION(ord_spline+1,NNN-1), INTENT(IN) :: spline_pmin, spline_Vsat
REAL(pr), DIMENSION(NNN,MMM), INTENT(IN) :: TTT, ppp, ccc, xxx
!
! Local Variables
INTEGER :: i, j
REAL(pr) :: x_mesh_test, delta_u, delta_v, v_min_li, v_max_li, &
& T_down_left, T_down_right, T_up_left, T_up_right, &
& p_down_left, p_down_right, p_up_left, p_up_right, &
& c_down_left, c_down_right, c_up_left, c_up_right, &
& x_down_left, x_down_right, x_up_left, x_up_right, &
& DEN, A, B, D, E
!
! to identify the cell within the test-point is:
!
delta_u = y_mesh(2) - y_mesh(1)
i = INT((u_in - y_mesh(1))/delta_u) + 1 ! to identify the interval on the vertical axis
!
! Initialization of v_min_li and v_max_li
v_min_li = 0_pr
v_max_li = 0_pr
!
DO j = 1, ord_spline + 1
v_min_li = v_min_li + spline_Vsat(ord_spline+2-j,i) * u_in**(j-1)
v_max_li = v_max_li + spline_pmin(ord_spline+2-j,i) * u_in**(j-1)
ENDDO
!
! Evaluation of x_mesh_test:
!
!print*, x_mesh(MMM), x_mesh(1)
!print*, LOG10(v_max_li),LOG10(v_min_li)
!print*, LOG10(v_in),LOG10(v_min_li)
x_mesh_test = ((x_mesh(MMM) - x_mesh(1)) / (LOG10(v_max_li) - LOG10(v_min_li)))&
&* (LOG10(v_in) - LOG10(v_min_li)) + x_mesh(1)
!
delta_v = x_mesh(2) - x_mesh(1)
j = INT((x_mesh_test - x_mesh(1))/delta_v) + 1 ! to identify the interval on the horizontal axis
! for v_in very close to the saturation curve
IF (j==0) THEN
j=1
ENDIF
!print*, 'x_mesh_test', x_mesh_test, x_mesh(1),delta_v
!
! once that the cell has been identified,
! it is possible to evaluate properties at the vertices:
!
T_down_left = TTT(i,j)
T_down_right = TTT(i,j+1)
T_up_left = TTT(i+1,j)
T_up_right = TTT(i+1,j+1)
!
p_down_left = ppp(i,j)
p_down_right = ppp(i,j+1)
p_up_left = ppp(i+1,j)
p_up_right = ppp(i+1,j+1)
!print*, p_down_left,p_down_right,p_up_left,p_up_right
!print*, i,j
!
c_down_left = ccc(i,j)
c_down_right = ccc(i,j+1)
c_up_left = ccc(i+1,j)
c_up_right = ccc(i+1,j+1)
!
x_down_left = xxx(i,j)
x_down_right = xxx(i,j+1)
x_up_left = xxx(i+1,j)
x_up_right = xxx(i+1,j+1)
!
! Bilinear Interpolation:
!
DEN = (x_mesh(j+1) - x_mesh(j)) * (y_mesh(i) - y_mesh(i+1))
A = (x_mesh(j+1) - x_mesh_test) * (y_mesh(i) - u_in)
B = (x_mesh_test - x_mesh(j)) * (y_mesh(i) - u_in)
D = (x_mesh(j+1) - x_mesh_test) * (u_in - y_mesh(i+1))
E = (x_mesh_test - x_mesh(j)) * (u_in - y_mesh(i+1))
!
T_out = (A/DEN) * T_up_left + (B/DEN) * T_up_right + (D/DEN) * T_down_left + &
& (E/DEN) * T_down_right
!
p_out = (A/DEN) * p_up_left + (B/DEN) * p_up_right + (D/DEN) * p_down_left + &
& (E/DEN) * p_down_right
!
c_out = (A/DEN) * c_up_left + (B/DEN) * c_up_right + (D/DEN) * c_down_left + &
& (E/DEN) * c_down_right
!
x_out = (A/DEN) * x_up_left + (B/DEN) * x_up_right + (D/DEN) * x_down_left + &
& (E/DEN) * x_down_right
!
END SUBROUTINE Lin_TP_Log10
!
!
! ===================================================================
!
! Bilinear_interp_TP
!
! ===================================================================
!
! It receives as input a couple of values (u_in, v_in),
! identifies the cell of the grid within the point is, and, finally,
! evaluates properties using the matrices already computed, by using
! a bilinear interpolation between the vertices of the cell.
!
! ===================================================================
!
SUBROUTINE Lin_TP(T_out, p_out, c_out, x_out, u_in, v_in, NNN, MMM, x_mesh,&
&y_mesh, spline_pmin, spline_Vsat, TTT, ppp, ccc, xxx)
!
! Global Variables
REAL(pr), INTENT(OUT) :: T_out, p_out, c_out, x_out
REAL(pr), INTENT(IN) :: u_in, v_in
INTEGER, INTENT(IN) :: NNN, MMM
REAL(pr), DIMENSION(NNN), INTENT(IN) :: y_mesh
REAL(pr), DIMENSION(MMM), INTENT(IN) :: x_mesh
REAL(pr), DIMENSION(ord_spline+1,NNN-1), INTENT(IN) :: spline_pmin, spline_Vsat
REAL(pr), DIMENSION(NNN,MMM), INTENT(IN) :: TTT, ppp, ccc, xxx
!
! Local Variables
INTEGER :: i, j
REAL(pr) :: x_mesh_test, delta_u, delta_v, v_min_li, v_max_li, &
& T_down_left, T_down_right, T_up_left, T_up_right, &
& p_down_left, p_down_right, p_up_left, p_up_right, &
& c_down_left, c_down_right, c_up_left, c_up_right, &
& x_down_left, x_down_right, x_up_left, x_up_right, &
& DEN, A, B, D, E
!
! to identify the cell within the test-point is:
!
delta_u = y_mesh(2) - y_mesh(1)
i = INT((u_in - y_mesh(1))/delta_u) + 1 ! to identify the interval on the vertical axis
!
! Initialization of v_min_li and v_max_li
v_min_li = 0_pr
v_max_li = 0_pr
!
DO j = 1, ord_spline + 1
v_min_li = v_min_li + spline_Vsat(ord_spline+2-j,i) * u_in**(j-1)
v_max_li = v_max_li + spline_pmin(ord_spline+2-j,i) * u_in**(j-1)
ENDDO
!
! Evaluation of x_mesh_test:
!
x_mesh_test = ((x_mesh(MMM) - x_mesh(1)) / &
& (v_max_li - v_min_li)) * (v_in - v_min_li) + x_mesh(1)
!
delta_v = x_mesh(2) - x_mesh(1)
j = INT((x_mesh_test - x_mesh(1))/delta_v) + 1 ! to identify the interval on the horizontal axis
!
!
! once that the cell has been identified,
! it is possible to evaluate properties at the vertices:
!
T_down_left = TTT(i,j)
T_down_right = TTT(i,j+1)
T_up_left = TTT(i+1,j)
T_up_right = TTT(i+1,j+1)
!
p_down_left = ppp(i,j)
p_down_right = ppp(i,j+1)
p_up_left = ppp(i+1,j)
p_up_right = ppp(i+1,j+1)
!
c_down_left = ccc(i,j)
c_down_right = ccc(i,j+1)
c_up_left = ccc(i+1,j)
c_up_right = ccc(i+1,j+1)
!
x_down_left = xxx(i,j)
x_down_right = xxx(i,j+1)
x_up_left = xxx(i+1,j)
x_up_right = xxx(i+1,j+1)
!
! Bilinear Interpolation:
!
DEN = (x_mesh(j+1) - x_mesh(j)) * (y_mesh(i) - y_mesh(i+1))
A = (x_mesh(j+1) - x_mesh_test) * (y_mesh(i) - u_in)
B = (x_mesh_test - x_mesh(j)) * (y_mesh(i) - u_in)
D = (x_mesh(j+1) - x_mesh_test) * (u_in - y_mesh(i+1))
E = (x_mesh_test - x_mesh(j)) * (u_in - y_mesh(i+1))
!
T_out = (A/DEN) * T_up_left + (B/DEN) * T_up_right + (D/DEN) * T_down_left + &
& (E/DEN) * T_down_right
!
p_out = (A/DEN) * p_up_left + (B/DEN) * p_up_right + (D/DEN) * p_down_left + &
& (E/DEN) * p_down_right
!
c_out = (A/DEN) * c_up_left + (B/DEN) * c_up_right + (D/DEN) * c_down_left + &
& (E/DEN) * c_down_right
!
x_out = (A/DEN) * x_up_left + (B/DEN) * x_up_right + (D/DEN) * x_down_left + &
& (E/DEN) * x_down_right
!
END SUBROUTINE Lin_TP
END MODULE interp_functions