Pages that link to "Item:Q2877077"

The following pages link to A residual replacement strategy for improving the maximum attainable accuracy of \(s\)-step Krylov subspace methods (Q2877077):

Displaying 13 items.

• The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002) (← links)
• An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. (Q778541) (← links)
• Varying the \(s\) in your \(s\)-step GMRES (Q1744315) (← links)
• An efficient deflation technique for the communication-avoiding conjugate gradient (Q2341373) (← links)
• Variants of the groupwise update strategy for short-recurrence Krylov subspace methods (Q2360676) (← links)
• Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods (Q2870667) (← links)
• The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology (Q4553788) (← links)
• The Adaptive $s$-Step Conjugate Gradient Method (Q4584923) (← links)
• Avoiding Communication in Primal and Dual Block Coordinate Descent Methods (Q4613501) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• On the cost of iterative computations (Q4993500) (← links)
• Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision (Q5264995) (← links)
• Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method (Q5373919) (← links)