SUMMARY This paper introduces tensorial calculus techniques in the framework of POD to reduce the computational complexity of the reduced nonlinear terms. The resulting method, named tensorial POD, can be applied to polynomial nonlinearities of any degree p . Such nonlinear terms have an online complexity of , where k is the dimension of POD basis and therefore is independent of full space dimension. However, it is efficient only for quadratic nonlinear terms because for higher nonlinearities, POD model proves to be less time consuming once the POD basis dimension k is increased. Numerical experiments are carried out with a two‐dimensional SWE test problem to compare the performance of tensorial POD, POD, and POD/discrete empirical interpolation method (DEIM). Numerical results show that tensorial POD decreases by 76× the computational cost of the online stage of POD model for configurations using more than 300,000 model variables. The tensorial POD SWE model was only 2 to 8× slower than the POD/DEIM SWE model but the implementation effort is considerably increased. Tensorial calculus was again employed to construct a new algorithm allowing POD/DEIM SWE model to compute its offline stage faster than POD and tensorial POD approaches.
No takes yet. Share an insight, caveat, or question.
Ştefanescu et al. (2014) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: