An adaptive s-step conjugate gradient algorithm with dynamic basis updating.
From MaRDI portal
(Redirected from Publication:778541)
An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
Recommendations
Cites work
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- A Newton basis GMRES implementation
- A parallel GMRES version for general sparse matrices
- A residual replacement strategy for improving the maximum attainable accuracy of \(s\)-step Krylov subspace methods
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Accuracy of two three-term and three two-term recurrences for Krylov space solvers
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
- Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Hiding global communication latency in the GMRES algorithm on massively parallel machines
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- Krylov subspace methods. Principles and analysis.
- Methods of conjugate gradients for solving linear systems
- Newton interpolation at Leja points
- On the evaluation of polynomial coefficients
- On the generation of Krylov subspace bases
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Reliable updated residuals in hybrid Bi-CG methods
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- The Condition of Polynomials in Power Form
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- The University of Florida sparse matrix collection
- The adaptive \(s\)-step conjugate gradient method
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Varying the \(s\) in your \(s\)-step GMRES
- s-step iterative methods for symmetric linear systems
Cited in
(5)- An Adaptive $s$-step Conjugate Gradient Algorithm with Dynamic Basis Updating
- 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
- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
- Block Gram-Schmidt algorithms and their stability properties
This page was built for publication: An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778541)
