-
Notifications
You must be signed in to change notification settings - Fork 2
/
README
182 lines (138 loc) · 3.12 KB
/
README
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
*********************************************************************
This software is provided AS IS with NO WARRANTY.
*********************************************************************
Hi Fortran Programmers
OK, the function interpreter is now finished (at least to a level that
satisfies me).
PLEASE, this code comes AS IS without any warranty of any kind. I have
developed this code enough to satisfy my own needs and no body elses.
If you find a use for it, well and good. If you manage to improve on
it, please me know and I will put the improvements in my own code.
The interpreter does 61 functions
cos(x)
sin(x)
tan(x)
exp(x)
log(x)
log10(x)
logn(x,y)
sqrt(x)
cbrt(x)
acos(x)
asin(x)
atan(x)
cosh(x)
sinh(x)
tanh(x)
anint(x)
aint(x)
abs(x)
delta(x)
step(x)
hat(x)
min(x,y)
max(x,y)
besj0(x)
besj1(x)
besjn(n,x)
besy0(x)
besy1(x)
besyn(n,x)
besi0(x)
besi1(x)
besin(n,x)
besk0(x)
besk1(x)
beskn(n,x)
erf(x)
erfc(x)
ierf(x)
ierfc(x)
gamma(x)
lgamma(x)
csch(x)
sech(x)
coth(x)
if(conditional, true, false)
gauss(x)
sinc(x)
fresc(x)
fress(x)
expi(x)
sini(x)
cosi(x)
logi(x)
elle(x)
ellk(x)
ielle(x, phi)
iellf(x, phi)
modulo(x,y)
mod(x,y)
floor(x)
ceiling(y)
16 operators
+
-
*
/
// Integer Divide
% Integer modulo
**
^
>
>=
=>
<
<=
=<
==
=
!=
brackets and correct order of operation.
Numbers are all assumed to be double precision real and are entered in
the usual fortran double precision way (or any way that read(*,*) num
will interpret)
# = integer
#
.#
#.#
#.#d#
#.#d-#
#.#d+#
#.#e#
#.#e-#
#.#e+#
#.#D#
#.#D-#
#.#D+#
#.#E#
#.#E-#
#.#E+#
etc...
The functions are simply strings with any number of possible variables
**** THE CODE NOW HAS ERROR DETECTION ****
Yes, I got around to adding it at the request of a user of my code.
Basically, the code will try to detect when an illegal function is
entered. It is quite basic, but seems to work quite well.
Basically, when calling the function, you have the option of
including an error field ( character(len=#)::error ). If no error
occurs, this error field will contain OK. If an error is detected
then error will contain the first # chacters of the error explanation.
It will still return a valid number (that obtained previously) but you
can at least have some primitive idea of what went wrong.
********************************************
**** THE CODE NOW DOES ERROR LIMIT COMPUTATIONS ****
The code now allows the computation of error calculations of the form
D = delta (error)
d = partial derivative
Df = df/dx Dx + df/dy Dy
You input the variables using a square bracket
x[0.1]
would give an error of 0.1 on the variable x.
******************************************************
Anyway, the code isn't documented, though it should be really easy to
follow.
KNOWN PROBLEMS
No known problems.
If you have any problems, let me know.
Stu.