Related papers: An asynchronous incomplete block LU preconditioner…
A multigrid scheme is proposed for the pressure equation of the incompressible unsteady fluid flow equations, allowing efficient implementation on clusters of modern CPUs, many integrated core devices (MICs), and graphics processing units…
We show that finite element discretizations of incompressible flow problems can be designed to ensure preservation/dissipation of kinetic energy not only globally but also locally. In the context of equal-order (piecewise-linear)…
We address semigroup well-posedness for a linear, compressible viscous fluid interacting at its boundary with an elastic plate. We derive the model by linearizing the compressible Navier-Stokes equations about an arbitrary flow state, so…
Iterative solvers preconditioned with algebraic multigrid have been devised as an optimal technology to speed up the response of large sparse linear systems. In this work, this technique was implemented in the framework of the dual…
In this work we propose a novel block preconditioner, labelled Explicit Decoupling Factor Approximation (EDFA), to accelerate the convergence of Krylov subspace solvers used to address the sequence of non-symmetric systems of linear…
We present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems…
Preconditioning for overdetermined least-squares problems has received comparatively little attention, and designing methods that are both effective and memory-efficient remains challenging. We propose a class of ILU-based preconditioners…
Multiphase flow is a critical process in a wide range of applications, including carbon sequestration, contaminant remediation, and groundwater management. Typically, this process is modeled by a nonlinear system of partial differential…
This work develops an all-at-once space-time preconditioning approach for resistive magnetohydrodynamics (MHD). We consider parallel-in-time due to the long time domains required to capture the physics of interest, as well as the complexity…
This paper develops efficient preconditioned iterative solvers for incompressible flow problems discretised by an enriched Taylor-Hood mixed approximation, in which the usual pressure space is augmented by a piecewise constant pressure to…
We propose an augmented Lagrangian preconditioner for a three-field stress-velocity-pressure discretization of stationary non-Newtonian incompressible flow with an implicit constitutive relation of power-law type. The discretization…
We develop a robust matrix-free, communication avoiding parallel, high-degree polynomial preconditioner for the Conjugate Gradient method for large and sparse symmetric positive definite linear systems. We discuss the selection of a scaling…
This paper shows a method of symmetrization of an asymmetric flow of a vis-cous incompressible fluid in a flat diffuser using a weak periodic vibration ef-fect on the velocity input flow. The results are obtained for a viscous…
In this paper, we are interested in an efficient numerical method for the mixed-dimensional approach to modeling single-phase flow in fractured porous media. The model introduces fractures and their intersections as lower-dimensional…
Many application problems that lead to solving linear systems make use of preconditioned Krylov subspace solvers to compute their solution. Among the most popular preconditioning approaches are incomplete factorization methods either as…
We develop a novel iterative solution method for the incompressible Navier-Stokes equations with boundary conditions coupled with reduced models. The iterative algorithm is designed based on the variational multiscale formulation and the…
ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present TPILU(k), the first efficiently parallelized ILU(k) preconditioner that…
Krylov subspace methods are linear solvers based on matrix-vector multiplications and vector operations. While easily parallelizable, they are sensitive to rounding errors and may experience convergence issues. ILU(0), an incomplete LU…
There are variety of computational algorithms need sequential sweeping; sweeping based on specific order; on a structured grid, e.g., preconditioning (smoothing) by SOR or ILU methods and solution of eikonal equation by fast sweeping…
The paper discusses a reuse of matrix factorization as a building block in the Augmented Lagrangian (AL) and modified AL preconditioners for non-symmetric saddle point linear algebraic systems. The strategy is applied to solve…