Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part
From MaRDI portal
Publication:1643846
DOI10.1016/j.cam.2018.04.023zbMath1426.15001OpenAlexW2806238792WikidataQ129871667 ScholiaQ129871667MaRDI QIDQ1643846
Publication date: 20 June 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.04.023
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Low-rank updates of balanced incomplete factorization preconditioners
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Short-Term Recurrence Krylov Subspace Methods for Nearly Hermitian Matrices
- The university of Florida sparse matrix collection
- The Arnoldi Process and GMRES for Nearly Symmetric Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- ILUT: A dual threshold incomplete LU factorization
- Algorithm 844
This page was built for publication: Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part