ADArgus A. Dunca

Argus A. Dunca

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Argus A. Dunca has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

    • 9 March 2020
    • Published by HAL in HAL
    Open Access

    Modeling Error of $α$-Models of Turbulence on a Two-Dimensional Torus

    by Luigi Berselli, Argus Dunca, Roger Lewandowski, Duong Nguyen, Dinh Duong, Nguyen Modeling, Dinh Duong Nguyen

    This paper is devoted to study the rate of convergence of the weak solutions $u_\alpha$ of $\alpha$-regularization models to the weak solution $bu$ of the Navier-Stokes equations in the two-dimensional periodic case, as the regularization parameter $\alpha$ goes to zero. More specifically, we will consider the Leray-$\alpha$, the simplified Bardina, and the modified Leray-$\alpha$ models. Our aim is to improve known results in terms of convergence rates and also to show estimates valid over long time intervals.

  • The reduced order NS-αmodel for incompressible flow: theory, numerical analysis and benchmark testing

    by Victoria M. Cuff, Argus A. Dunca, Carolina C. Manica, Leo G. Rebholz

    This paper introduces a new, reduced-order NS-α (rNS-α) model for the purpose of efficient, stable, and accurate simulations of incompressible flow problems on coarse meshes. We motivate the new model by discussing the difficulties in efficient and stable algorithm construction for the usual NS-α model, and then derive rNS-α by using deconvolution as an approximation to the filter inverse, which reduces the fourth order NS-α formulation to a second order model. After proving the new model is well-posed, we propose a C 0 finite element spatial discretization together with an IMEX BDF2 timestepping to create a linearized algorithm that decouples the conservation of mass and momentum equations from the filtering. We rigorously prove the algorithm is well-posed, and provided a very mild timestep restriction, is also stable and converges optimally to the model solution. Finally, we give results of several benchmark computations that confirm the theory and show the proposed model/scheme is effective at efficiently finding accurate coarse mesh solutions to flow problems.