s-step iterative methods for symmetric linear systems
From MaRDI portal
S-step iterative methods for symmetric linear systems
Recommendations
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- A hybrid iterative method for symmetric positive definite linear systems
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- A generalization of s-step variants of gradient methods
- Parallel iterative S-step methods for unsymmetric linear systems
Cites work
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3057625 (Why is no real title available?)
- An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
- Block Preconditioning for the Conjugate Gradient Method
- Methods of conjugate gradients for solving linear systems
- Moments and characteristic roots
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- On the asymptotic directions of the s-dimensional optimum gradient method
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The block conjugate gradient algorithm and related methods
- The block preconditioned conjugate gradient method on vector computers
- Über einige Methoden der Relaxationsrechnung
Cited in
(52)- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- Implementation of an adaptive algorithm for Richardson's method
- Communication Avoiding ILU0 Preconditioner
- Efficient Implementations of Certain Iterative Methods
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
- On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- Two implementations of the preconditioned conjugate gradient method on heterogeneous computing grids
- Delayed gradient methods for symmetric and positive definite linear systems
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Developing variable \(s\)-step CGNE and CGNR algorithms for non-symmetric linear systems
- Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
- The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
- Numerical results on the SD and CG methods for slightly non-symmetric matrices
- Block-\(s\)-step Krylov iterative methods
- Pipelined, flexible Krylov subspace methods
- Non-adaptive and adaptive SAOR-CG algorithms
- Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined conjugate gradient method
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- Scalable asynchronous domain decomposition solvers
- A generalization of \(s\)-step variants of gradient methods
- s-step enlarged Krylov subspace conjugate gradient methods
- The adaptive \(s\)-step conjugate gradient method
- Matrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs
- Projection-minimization methods for nonsymmetric linear systems
- scientific article; zbMATH DE number 1977309 (Why is no real title available?)
- High performance inverse preconditioning
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Improving the arithmetic intensity of multigrid with the help of polynomial smoothers.
- Analysis and practical use of flexible biCGStab
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- Parallel finite element technique using Gaussian belief propagation
- A numerically stable communication-avoiding \(s\)-step GMRES algorithm
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- Minimizing synchronization in \(\text{IDR}(s)\).
- Pipelined iterative solvers with kernel fusion for graphics processing units
- An efficient nonsymmetric Lanczos method on parallel vector computers
- scientific article; zbMATH DE number 1894318 (Why is no real title available?)
- Multiple search direction conjugate gradient method I: methods and their propositions
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- A parallel alternating direction implicit preconditioning method
- Multiple search direction conjugate gradient method II: theory and numerical experiments
- Predict-and-Recompute Conjugate Gradient Variants
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
- Iterative methods for unsymmetric linear systems
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- A \(s\)-step variant of the double orthogonal series algorithm
- The techniques for constructing a family of symmetric multistep methods
- Scalability pipelined algorithm of the conjugate gradient method on heterogeneous platforms
This page was built for publication: s-step iterative methods for symmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118971)
