s-step iterative methods for symmetric linear systems

DOI10.1016/0377-0427(89)90045-9zbMath0669.65021OpenAlexW2066692739MaRDI QIDQ1118971

C. William Gear, Anthony Theodore Chronopoulos

Publication date: 1989

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(89)90045-9

zbMATH Keywords

numerical resultsparallel computationconjugate gradient methodStabilityparallel processingmulti-step CG methods-step conjugate residual method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (36)

Minimizing synchronization in IDR (s ) ⋮ High performance inverse preconditioning ⋮ Parallel finite element technique using Gaussian belief propagation ⋮ Minimizing synchronizations in sparse iterative solvers for distributed supercomputers ⋮ The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ Projection-minimization methods for nonsymmetric linear systems ⋮ Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers ⋮ Multiple search direction conjugate gradient method I: methods and their propositions ⋮ Analysis and practical use of flexible biCGStab ⋮ Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ The Adaptive $s$-Step Conjugate Gradient Method ⋮ Matrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs ⋮ A generalization of \(s\)-step variants of gradient methods ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ Avoiding Communication in Primal and Dual Block Coordinate Descent Methods ⋮ Predict-and-Recompute Conjugate Gradient Variants ⋮ Scalable Asynchronous Domain Decomposition Solvers ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic ⋮ An efficient nonsymmetric Lanczos method on parallel vector computers ⋮ Multiple search direction conjugate gradient method II: theory and numerical experiments ⋮ Improving the arithmetic intensity of multigrid with the help of polynomial smoothers ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ s-Step Enlarged Krylov Subspace Conjugate Gradient Methods ⋮ Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication ⋮ Pipelined, Flexible Krylov Subspace Methods ⋮ Algorithmic optimizations of a conjugate gradient solver on shared memory architectures ⋮ An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. ⋮ Scalability pipelined algorithm of the conjugate gradient method on heterogeneous platforms ⋮ Communication Avoiding ILU0 Preconditioner ⋮ Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision ⋮ Implementation of an adaptive algorithm for Richardson's method ⋮ A parallel alternating direction implicit preconditioning method ⋮ Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The block preconditioned conjugate gradient method on vector computers
• Moments and characteristic roots
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• The block conjugate gradient algorithm and related methods
• Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
• On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
• On the asymptotic directions of the s-dimensional optimum gradient method
• Über einige Methoden der Relaxationsrechnung
• Block Preconditioning for the Conjugate Gradient Method
• On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
• An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• Methods of conjugate gradients for solving linear systems

This page was built for publication: s-step iterative methods for symmetric linear systems