The rate of convergence of conjugate gradients
Numerische Mathematik
Deflation of conjugate gradients with applications to boundary value problems
SIAM Journal on Numerical Analysis
On the conjugate gradient solution of the Schur complement system obtained from domain decomposition
SIAM Journal on Numerical Analysis
SIAM Journal on Scientific and Statistical Computing
Efficient computational schemes of the conjugate gradient method for solving linear systems
Journal of Computational Physics
A Restarted GMRES Method Augmented with Eigenvectors
SIAM Journal on Matrix Analysis and Applications
Journal of Computational and Applied Mathematics
Restarted GMRES preconditioned by deflation
Journal of Computational and Applied Mathematics
Journal of Computational Physics
An unstructured grid-based, parallel free surface solver
Applied Numerical Mathematics
A Deflated Version of the Conjugate Gradient Algorithm
SIAM Journal on Scientific Computing
Journal of Computational Physics
On the Construction of Deflation-Based Preconditioners
SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Multistage explicit advective prediction for projection-type incompressible flow solvers
Journal of Computational Physics
Multigrid methods for the incompressible navier-stokes problem on three-dimensional unstructured meshes
Computational modelling of blood flow in side arterial branches after stenting of cerebral aneurysms
International Journal of Computational Fluid Dynamics
A massively parallel fractional step solver for incompressible flows
Journal of Computational Physics
Accelerated 3D multi-body seakeeping simulations using unstructured finite elements
Journal of Computational Physics
Hi-index | 31.46 |
A deflated preconditioned conjugate gradient technique has been developed for the solution of the Pressure-Poisson equation within an incompressible flow solver. The deflation is done using a region-based decomposition of the unknowns, making it extremely simple to implement. The procedure has shown a considerable reduction in the number of iterations. For grids with large graph-depth the savings exceed an order of magnitude. Furthermore, the technique has shown a remarkable insensitivity to the number of groups/regions chosen, and to the way the groups are formed.