Filters

2018 - 201912020 - 20211

More filters

2019 - 201912020 - 20221
Reset filters

Settings

Author: Jha, Abhinav ×

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    An assessment of solvers for algebraically stabilized discretizations of convection-diffusion-reaction equations
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Jha, Abhinav; Pártl, Ondřej; Ahmed, Naveed; Kuzmin, Dmitri
    We consider flux-corrected finite element discretizations of 3D convection-dominated transport problems and assess the computational efficiency of algorithms based on such approximations. The methods under investigation include flux-corrected transport schemes and monolithic limiters. We discretize in space using a continuous Galerkin method and P1 or Q1 finite elements. Time integration is performed using the Crank-Nicolson method or an explicit strong stability preserving Runge-Kutta method. Nonlinear systems are solved using a fixed-point iteration method, which requires solution of large linear systems at each iteration or time step. The great variety of options in the choice of discretization methods and solver components calls for a dedicated comparative study of existing approaches. To perform such a study, we define new 3D test problems for time dependent and stationary convection-diffusion-reaction equations. The results of our numerical experiments illustrate how the limiting technique, time discretization and solver impact on the overall performance.
  • Thumbnail Image
    Item
    On basic iteration schemes for nonlinear AFC discretizations
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2018) Jha, Abhinav; John, Volker
    Algebraic flux correction (AFC) finite element discretizations of steady-state convection-diffusionreaction equations lead to a nonlinear problem. This paper presents first steps of a systematic study of solvers for these problems. Two basic fixed point iterations and a formal Newton method are considered. It turns out that the fixed point iterations behave often quite differently. Using a sparse direct solver for the linear problems, one of them exploits the fact that only one matrix factorization is needed to become very efficient in the case of convergence. For the behavior of the formal Newton method, a clear picture is not yet obtained.