GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
An extended set of FORTRAN basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
How fast are nonsymmetric matrix iterations
SIAM Journal on Matrix Analysis and Applications
A Hybrid GMRES algorithm for nonsymmetric linear systems
SIAM Journal on Matrix Analysis and Applications
A robust GMRES-based adaptive polynomial preconditioning algorithm for nonsymmetric linear systems
SIAM Journal on Scientific Computing
A Restarted GMRES Method Augmented with Eigenvectors
SIAM Journal on Matrix Analysis and Applications
Restarted GMRES preconditioned by deflation
Journal of Computational and Applied Mathematics
Nested Krylov methods based on GCR
Journal of Computational and Applied Mathematics
Analysis of Augmented Krylov Subspace Methods
SIAM Journal on Matrix Analysis and Applications
Optimizing a Parallel Conjugate Gradient Solver
SIAM Journal on Scientific Computing
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Adaptively Preconditioned GMRES Algorithms
SIAM Journal on Scientific Computing
Achieving high sustained performance in an unstructured mesh CFD application
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
SIAM Journal on Matrix Analysis and Applications
Analysis of acceleration strategies for restarted minimal residual methods
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
Truncation Strategies for Optimal Krylov Subspace Methods
SIAM Journal on Numerical Analysis
IEEE Micro
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
SLAMM - Automating Memory Analysis for Numerical Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We describe a new technique for solvinga sparse linear system Ax = b as a block system AX = B, where multiple starting vectors and right-hand sides are chosen so as to accelerate convergence. Efficiency is gained by reusing the matrix A in block operations with X and B. Techniques for reducingthe cost of the extra matrix-vector operations are presented.