Compiler options

Added new compiler options to attempt to speed up runtime. Not enough loops are auto-parallelized to see substantial effect.

Started thinking about a hash-based lookup for the n^2 problem of determining connections based on element names.
I have a solution that will be memory efficient but I am having trouble translating it into FORTRAN. My idea:
MESH names are 5 characters long, and each character contains [0-9A-Z].
Map [0-9A-Z] to (1,36).
Loop through elem and keep track of min and max value of each of the five characters using the map.
Store minimum as offsets for an augmented map.
Use max-min's to create a hash table of size product(max(array(i))-min(array(i)), i = 1,5).
Loop through elem again and put their locations in the elem list into the hash table, which is by creation collision-less.
Loop through conx and lookup the elem name via the hash table and the augmented map.
The hash table size will be reasonably small and (more importantly) dense for all MESHes included in this project (I checked their naming schemes).

Old method: Order(n^2) work, where n is the length of elem.
Hash method: Order(n) work, albeit with a bigger constant (overhead of the hash).
Merge branch 'master' of https://github.com/alexlongne/parpetro
Changing array bounds for ierror

So it will compile with Debug.