Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems
Advances in Engineering Software - Engineering computational technology
Comparison of Krylov subspace methods on the PageRank problem
Journal of Computational and Applied Mathematics
On a new iterative method for solving linear systems and comparison results
Journal of Computational and Applied Mathematics
Preconditioner updates applied to CFD model problems
Applied Numerical Mathematics
Journal of Computational and Applied Mathematics
A Jacobian-free Newton-Krylov algorithm for compressible turbulent fluid flows
Journal of Computational Physics
Preconditioning methods for discontinuous Galerkin solutions of the Navier-Stokes equations
Journal of Computational Physics
A comparison of projective and direct solvers for finite elements in elastostatics
Advances in Engineering Software
New implementation of QMR-type algorithms
Computers and Structures
Journal of Computational Physics
Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers
SIAM Journal on Scientific Computing
A domain-decomposing parallel sparse linear system solver
Journal of Computational and Applied Mathematics
Journal of Computational Physics
Improved Scaling for Quantum Monte Carlo on Insulators
SIAM Journal on Scientific Computing
Using performance profiles to evaluate preconditioners for iterative methods
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Hi-index | 0.03 |
Numerical experiments are presented whereby the effect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are different variants of incomplete factorizations. It is shown that certain reorderings for direct methods, such as reverse Cuthill--McKee, can be very beneficial. The benefit can be seen in the reduction of the number of iterations and also in measuring the deviation of the preconditioned operator from the identity.