Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods

DOI10.1137/120881191MaRDI QIDQ2870667zbMATH OpenOpenAlexFDO

Authors Erin Carson, Nicholas Knight, James Demmel

Publication date 21 January 2014

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

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

zbMATH Keywords

convergenceKrylov subspace methodsnumerical examplessparse matrixalgorithmeigenvalue problemiterative methodsparallel computationBICGSTABminimizing communicationBICGlarge, sparse systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)

Recommendations

• A residual replacement strategy for improving the maximum attainable accuracy of s-step Krylov subspace methods
• Enlarged Krylov subspace conjugate gradient methods for reducing communication
• Varying the \(s\) in your \(s\)-step GMRES
• An efficient deflation technique for the communication-avoiding conjugate gradient
• Hardware-oriented Krylov methods for high-performance computing

Cited in

(18)

• Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
• A residual replacement strategy for improving the maximum attainable accuracy of s-step Krylov subspace methods
• An efficient deflation technique for the communication-avoiding conjugate gradient
• Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined conjugate gradient method
• s-step enlarged Krylov subspace conjugate gradient methods
• Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
• The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
• Hardware-oriented Krylov methods for high-performance computing
• A numerically stable communication-avoiding s-step GMRES algorithm
• Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
• Communication lower bounds and optimal algorithms for numerical linear algebra
• Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
• Revisiting performance of biCGStab methods for solving systems with multiple right-hand sides
• Varying the \(s\) in your \(s\)-step GMRES
• Communication-hiding pipelined BiCGSafe methods for solving large linear systems
• Communication Avoiding ILU0 Preconditioner
• The adaptive s-step conjugate gradient method
• Enlarged Krylov subspace conjugate gradient methods for reducing communication

Describes a project that uses

Uses Software

• SparseMatrix

This page was built for publication: Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870667)