Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part
暂无分享,去创建一个
Juana Cerdán | José Marín | José Mas | Daniel Guerrero | J. Mas | J. Cerdán | D. Guerrero | J. Marín
[1] G. W. Stewart,et al. Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix , 1999, Numerische Mathematik.
[2] Fei Xue,et al. Short-Term Recurrence Krylov Subspace Methods for Nearly Hermitian Matrices , 2012, SIAM J. Matrix Anal. Appl..
[3] Luca Bergamaschi,et al. Erratum to: Inexact constraint preconditioners for linear systems arising in interior point methods , 2011, Comput. Optim. Appl..
[4] Gene H. Golub,et al. Matrix computations , 1983 .
[5] Henk A. van der Vorst,et al. Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..
[6] Yousef Saad,et al. ILUT: A dual threshold incomplete LU factorization , 1994, Numer. Linear Algebra Appl..
[7] Lothar Reichel,et al. The Arnoldi Process and GMRES for Nearly Symmetric Matrices , 2008, SIAM J. Matrix Anal. Appl..
[8] Timothy A. Davis,et al. The university of Florida sparse matrix collection , 2011, TOMS.
[9] Michael W. Berry,et al. Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices , 2005, TOMS.
[10] Juana Cerdán,et al. Low-rank updates of balanced incomplete factorization preconditioners , 2017, Numerical Algorithms.
[11] J. Gillis,et al. Matrix Iterative Analysis , 1961 .
[12] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .