For a typical finite element algorithms, what kind of order of growth in solution time (i.e solve stiffness matrix & post-processing) are we expected to see with an increase in number of elements?
Literature I have seen show exponential and power-law like behavior when comparing solve time to number of elements even when viewed on a log-log scale.
I ask this question as I have ran some analysis and plot the solution time vs number of elements, and it is not what I have expected, as it depicts almost linear behavior (loglog scale). Seen below:
This was the case for both parallel and serial processing.
Does anyone know why this could be?