We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier–Stokes equations. The spatial discretization is carried out using a discontinuous Galerkin method with fourth order polynomial interpolations on triangular elements. The time integration is based on backward difference formulas resulting in a nonlinear system of equations which is solved at each timestep. This is accomplished using Newton's method. The resulting linear systems are solved using a preconditioned GMRES iterative algorithm. We consider several existing preconditioners such as block Jacobi and Gauss–Seidel combined with multilevel schemes which have been developed and tested for specific a...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
Abstract. We study preconditioners for the iterative solution of the linear systems arising in the i...
An investigation of preconditioning techniques is presented for a Newton--Krylov algorithm that is u...
An investigation of preconditioning techniques is presented for a Newton--Krylov algorithm that is u...
The goal of our research is the construction of efficient Jacobian-free preconditioners for high ord...
We suggest a new multigrid preconditioning strategy for use in Jacobian-free Newton–Krylov (JFNK) me...
In this paper we investigate the possibility of using the high-order accurate A(α)-stable Second Der...
AbstractEfficient solution techniques for high-order temporal and spatial discontinuous Galerkin (DG...
This work presents and compares efficient implementations of high-order discontinuous Galerkin metho...
This work presents and compares efficient implementations of high-order discontinuous Galerkin metho...
This work presents and compares efficient implementations of high-order discontinuous Galerkin metho...
Efficient solution techniques for high-order temporal and spatial discontinuous Galerkin (DG) discre...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
Abstract. We study preconditioners for the iterative solution of the linear systems arising in the i...
An investigation of preconditioning techniques is presented for a Newton--Krylov algorithm that is u...
An investigation of preconditioning techniques is presented for a Newton--Krylov algorithm that is u...
The goal of our research is the construction of efficient Jacobian-free preconditioners for high ord...
We suggest a new multigrid preconditioning strategy for use in Jacobian-free Newton–Krylov (JFNK) me...
In this paper we investigate the possibility of using the high-order accurate A(α)-stable Second Der...
AbstractEfficient solution techniques for high-order temporal and spatial discontinuous Galerkin (DG...
This work presents and compares efficient implementations of high-order discontinuous Galerkin metho...
This work presents and compares efficient implementations of high-order discontinuous Galerkin metho...
This work presents and compares efficient implementations of high-order discontinuous Galerkin metho...
Efficient solution techniques for high-order temporal and spatial discontinuous Galerkin (DG) discre...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...
We outline a new class of robust and efficient methods for solving subproblems that arise in the lin...