Pages that link to "Item:Q1118971"

The following pages link to s-step iterative methods for symmetric linear systems (Q1118971):

Displayed 37 items.

• Parallel finite element technique using Gaussian belief propagation (Q314011) ‎ (← links)
• Minimizing synchronizations in sparse iterative solvers for distributed supercomputers (Q316448) ‎ (← links)
• The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002) ‎ (← links)
• A generalization of \(s\)-step variants of gradient methods (Q415206) ‎ (← links)
• An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. (Q778541) ‎ (← links)
• Implementation of an adaptive algorithm for Richardson's method (Q808615) ‎ (← links)
• A parallel alternating direction implicit preconditioning method (Q811084) ‎ (← links)
• High performance inverse preconditioning (Q841716) ‎ (← links)
• An efficient nonsymmetric Lanczos method on parallel vector computers (Q1200180) ‎ (← links)
• Matrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs (Q1684417) ‎ (← links)
• Projection-minimization methods for nonsymmetric linear systems (Q1902114) ‎ (← links)
• Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers (Q1904023) ‎ (← links)
• Scalability pipelined algorithm of the conjugate gradient method on heterogeneous platforms (Q2091474) ‎ (← links)
• Analysis and practical use of flexible biCGStab (Q2399204) ‎ (← links)
• Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication (Q2813336) ‎ (← links)
• Pipelined, Flexible Krylov Subspace Methods (Q2818249) ‎ (← links)
• Minimizing synchronization in IDR (<i>s</i> ) (Q2897405) ‎ (← links)
• Two implementations of the preconditioned conjugate gradient method on heterogeneous computing grids (Q2930578) ‎ (← links)
• Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation (Q4021070) ‎ (← 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)
• Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) ‎ (← links)
• Multiple search direction conjugate gradient method II: theory and numerical experiments (Q4652749) ‎ (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) ‎ (← links)
• Multiple search direction conjugate gradient method I: methods and their propositions (Q4823351) ‎ (← links)
• Improving the arithmetic intensity of multigrid with the help of polynomial smoothers (Q4921808) ‎ (← links)
• Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems (Q5094911) ‎ (← links)
• Predict-and-Recompute Conjugate Gradient Variants (Q5132005) ‎ (← links)
• Scalable Asynchronous Domain Decomposition Solvers (Q5147969) ‎ (← links)
• On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic (Q5161757) ‎ (← links)
• s-Step Enlarged Krylov Subspace Conjugate Gradient Methods (Q5208740) ‎ (← links)
• Communication Avoiding ILU0 Preconditioner (Q5254468) ‎ (← links)
• Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision (Q5264995) ‎ (← links)
• Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units (Q5270772) ‎ (← links)
• Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method (Q5373919) ‎ (← links)
• Algorithmic optimizations of a conjugate gradient solver on shared memory architectures (Q5481727) ‎ (← links)