A Note on GMRES Preconditioned by a Perturbed $L D L^T$ Decomposition with Static Pivoting

DOI10.1137/060661545zbMath1161.65023OpenAlexW2022484711MaRDI QIDQ3525953

S. Pralet, Serge Gratton, Mario Arioli, Iain S. Duff

Publication date: 23 September 2008

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060661545

zbMATH Keywords

numerical examplespreconditioningsparse matricesaugmented systemsroundoff errormultifrontal methodsflexible GMRESstatic pivotingsymmetric indefinite problems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Mixed precision algorithms in numerical linear algebra ⋮ Chebyshev acceleration of iterative refinement ⋮ A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems ⋮ GMRES algorithms over 35 years ⋮ Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions ⋮ An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems ⋮ Parallel algebraic hybrid solvers for large 3D convection-diffusion problems ⋮ Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices ⋮ Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems

This page was built for publication: A Note on GMRES Preconditioned by a Perturbed $L D L^T$ Decomposition with Static Pivoting