scholarly journals Adaptive Refinement in Advection–Diffusion Problems by Anomaly Detection: A Numerical Study

Algorithms ◽  
2021 ◽  
Vol 14 (11) ◽  
pp. 328
Author(s):  
Antonella Falini ◽  
Maria Lucia Sampoli

We consider advection–diffusion–reaction problems, where the advective or the reactive term is dominating with respect to the diffusive term. The solutions of these problems are characterized by the so-called layers, which represent localized regions where the gradients of the solutions are rather large or are subjected to abrupt changes. In order to improve the accuracy of the computed solution, it is fundamental to locally increase the number of degrees of freedom by limiting the computational costs. Thus, adaptive refinement, by a posteriori error estimators, is employed. The error estimators are then processed by an anomaly detection algorithm in order to identify those regions of the computational domain that should be marked and, hence, refined. The anomaly detection task is performed in an unsupervised fashion and the proposed strategy is tested on typical benchmarks. The present work shows a numerical study that highlights promising results obtained by bridging together standard techniques, i.e., the error estimators, and approaches typical of machine learning and artificial intelligence, such as the anomaly detection task.

2005 ◽  
Vol 15 (07) ◽  
pp. 1119-1139 ◽  
Author(s):  
RODOLFO ARAYA ◽  
ABNER H. POZA ◽  
ERNST P. STEPHAN

In this work we introduce a new a posteriori error estimate of hierarchical type for the advection-diffusion-reaction equation. We prove the equivalence between the energy norm of the error and our error estimate using an auxiliary linear problem for the residual and an easy way to prove inf–sup condition.


Author(s):  
Ihteram Ali ◽  
Sirajul Haq ◽  
Kottakkaran Sooppy Nisar ◽  
Shams Ul Arifeen

AbstractIn this work, a numerical scheme based on combined Lucas and Fibonacci polynomials is proposed for one- and two-dimensional nonlinear advection–diffusion–reaction equations. Initially, the given partial differential equation (PDE) reduces to discrete form using finite difference method and $$\theta -$$ θ - weighted scheme. Thereafter, the unknown functions have been approximated by Lucas polynomial while their derivatives by Fibonacci polynomials. With the help of these approximations, the nonlinear PDE transforms into a system of algebraic equations which can be solved easily. Convergence of the method has been investigated theoretically as well as numerically. Performance of the proposed method has been verified with the help of some test problems. Efficiency of the technique is examined in terms of root mean square (RMS), $$L_2$$ L 2 and $$L_\infty $$ L ∞ error norms. The obtained results are then compared with those available in the literature.


Sign in / Sign up

Export Citation Format

Share Document