An analysis on computational load of DIC based on Newton–Raphson scheme

Abstract Improving the computing speed of DIC to realize real-time computation has been increasingly important and highly demanded in recent years since DIC is currently used as an offline technique. In this paper, the computational load of DIC based on Newton–Raphson (NR) scheme, represented by the total number of associated arithmetic operations, is analyzed in detail when different computational configurations are adopted. The computational configurations refer to as the shape function, the interpolation algorithm and the subset size. A theoretical formula is presented to predict the computational load when different computational configurations are used. Then, numerical experiments are performed to obtain the real computing speed of our DIC program. A good inverse correlation is achieved between the theoretical computational load and experimental computing speed.