Debian Codegraph @

packages/seacas/applications/fastq/resta.f

raw
1 C Copyright(C) 1999-2020, 2024 National Technology & Engineering Solutions
2 C of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with
3 C NTESS, the U.S. Government retains certain rights in this software.
4 C
5 C See packages/seacas/LICENSE for details
6
7 SUBROUTINE RESTA (MXND, XN, YN, NUID, LXK, KXL, NXL, LXN, KKK,
8 & KKKOLD, NAVAIL, IAVAIL, NNN, LIMIT, IREST, TILT, ERR, NOROOM)
9 C************************************************************************
10
11 C SUBROUTINE RESTA = RESTRUCTURES THE MESH TO ELIMINATE WORST ELEMENTS
12
13 C***********************************************************************
14
15 C NOTE:
16 C A RECORD IS KEPT OF UP TO 25 OF THE CURRENT WORST CONDITION NUMBERS
17 C AND THE WORST ELEMENT POSSIBLE IS RESTRUCTURED
18 C UNTIL NO FURTHER RESTRUCTURING CAN BE DONE.
19
20 C***********************************************************************
21
22 DIMENSION KCND(26), CND(26)
23 DIMENSION NXL(2, 3*MXND), XN(MXND), YN(MXND), NUID(MXND)
24 DIMENSION LXK(4, MXND), KXL(2, 3*MXND), LXN(4, MXND)
25 DIMENSION NODES(4), ANGLES(4), SIDES(4)
26
27 LOGICAL ERR, NOROOM, LSIDE, CCW, CAREA, DONE
28
29 ERR = .FALSE.
30
31 C CHECK FOR IMPENDING OVERFLOW
32
33 IF (NAVAIL .LE. 1) THEN
34 NOROOM = .TRUE.
35 CALL MESSAGE('INSUFFICIENT STORAGE AVAILABLE IN RESTA')
36 RETURN
37 ENDIF
38
39 C INITIALIZE
40
41 NTAB = 0
42 MAXTAB = 25
43 CNDTOL = 2.0
44 ASUM = 0.
45 NSUM = 0
46 CCW = .TRUE.
47 CAREA = .FALSE.
48 IREST = 0
49
50 DO 110 K = KKKOLD + 1, KKK
51 IF (LXK(1, K) .GT. 0) THEN
52 LSIDE = .FALSE.
53
54 C GET THE ELEMENTS COND VALUE (BASED ON ANGLE AND SIDE LENGTH)
55
56 CALL GNXKA (MXND, XN, YN, K, NODES, AREA, LXK, NXL, CCW)
57 CALL QAAVAL (MXND, NODES, ANGLES, QRAT, DUMMY, XN, YN,
58 & CAREA)
59 CALL CONDNO (MXND, NODES, QRAT, SRAT, COND, SIDES, XN, YN,
60 & LSIDE)
61
62 C ADD UP THE NUMBER OF ANGLES < PI/2
63
64 DO 100 I = 1, 4
65 IF (ANGLES(I) .LE. 1.58) THEN
66 ASUM = ASUM + ANGLES(I)
67 NSUM = NSUM + 1
68 ENDIF
69 100 CONTINUE
70
71 C ADD BAD ELEMENTS TO THE LIST
72
73 IF (COND .GE. CNDTOL) THEN
74 CND(NTAB + 1) = COND
75 KCND(NTAB + 1) = K
76 CALL BUBBLE (CND, KCND, NTAB, NTAB + 1)
77 NTAB = MIN0(NTAB + 1, MAXTAB)
78 ENDIF
79 ENDIF
80 110 CONTINUE
81
82 C TILT IS THE AVERAGE VALUE IN DEGREES OF ANGLES < PI/2
83
84 IF (NSUM .GT. 0) THEN
85 TILT = (ASUM/DBLE(NSUM))*57.2957795
86 ELSE
87 TILT = 90.
88 ENDIF
89 IF ((LIMIT .LE. 0) .OR. (NTAB .LE. 0)) RETURN
90 CNDTOL = CND(NTAB)
91
92 C TRY TO RESTRUCTURE ON THE 10 WORST ELEMENTS ONLY
93
94 120 CONTINUE
95 NTRY = MIN0(NTAB, 10)
96 DO 130 IK = 1, NTRY
97 IK1 = IK
98 CALL RESTRY (MXND, KCND(IK), K2, LXK, NXL, KXL, LXN, XN, YN,
99 & NUID, NAVAIL, IAVAIL, NNN, DONE, ERR, NOROOM)
100 IF (ERR) RETURN
101 IF (DONE) GO TO 140
102 130 CONTINUE
103 RETURN
104 140 CONTINUE
105 IREST = IREST + 1
106 IF (IREST .GE. LIMIT) RETURN
107
108 C UPDATE THE TABLE (AFTER 1 RESTRUCTURE)
109
110 CALL GNXKA (MXND, XN, YN, KCND(IK1), NODES, AREA, LXK, NXL, CCW)
111 CALL QAAVAL (MXND, NODES, ANGLES, QRAT, DUMMY, XN, YN, CAREA)
112 CALL CONDNO (MXND, NODES, QRAT, SRAT, COND1, SIDES, XN, YN, LSIDE)
113 CND(IK1) = COND1
114 DO 150 IK = 1, NTAB
115 IK2 = IK
116 IF (KCND(IK) .EQ. K2) GO TO 160
117 150 CONTINUE
118 IK2 = NTAB + 1
119 NTAB = NTAB + 1
120 160 CONTINUE
121 CALL GNXKA (MXND, XN, YN, K2, NODES, AREA, LXK, NXL, CCW)
122 CALL QAAVAL (MXND, NODES, ANGLES, QRAT, DUMMY, XN, YN, CAREA)
123 CALL CONDNO (MXND, NODES, QRAT, SRAT, COND2, SIDES, XN, YN, LSIDE)
124 CND(IK2) = COND2
125 KCND(IK2) = K2
126
127 C RE-SORT AND PRUNE
128
129 CALL BUBBLE (CND, KCND, 1, NTAB)
130 DO 170 I = 1, 2
131 IF (CND(NTAB) .LT. CNDTOL)NTAB = NTAB - 1
132 170 CONTINUE
133 NTAB = MIN0(NTAB, MAXTAB)
134 IF (NTAB .LE. 0) RETURN
135 CNDTOL = CND(NTAB)
136 GO TO 120
137
138 END