Multiple search direction conjugate gradient method I: methods and their propositions
From MaRDI portal
Recommendations
- Multiple search direction conjugate gradient method II: theory and numerical experiments
- scientific article; zbMATH DE number 1950397
- The multiparameter conjugate gradient algorithm
- Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions
- A Multipreconditioned Conjugate Gradient Algorithm
- A conjugate gradient method with descent direction for unconstrained optimization
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization
- A multigrid conjugate gradient method
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- scientific article; zbMATH DE number 3956828
Cites work
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- A performance model for Krylov subspace methods on mesh-based parallel computers
- Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors
- Generalized Schwarz Splittings
- Krylov Subspace Methods on Supercomputers
- Multitasking the conjugate gradient method on the CRAY X-MP/48
- Preconditioned CG methods for sparse matrices on massively parallel machines
- The block conjugate gradient algorithm and related methods
- The block preconditioned conjugate gradient method on vector computers
- s-step iterative methods for symmetric linear systems
Cited in
(18)- scientific article; zbMATH DE number 1950397 (Why is no real title available?)
- A parallel version of GPBi-CG method suitable for distributed parallel computing
- s-step enlarged Krylov subspace conjugate gradient methods
- A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation
- Conjugate residual squared method and its improvement for non-symmetric linear systems
- Gradient-based maximal convergence rate iterative method for solving linear matrix equations
- Multiple search direction conjugate gradient method II: theory and numerical experiments
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- Conjugate direction methods for multiple solution of SLAEs
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides
- An improved GBPi-CG algorithm suitable for distributed parallel computing
- An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- Iterative algorithm for minimal norm least squares solution to general linear matrix equations
- An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing
- An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing
- Improved QMRCGSTAB method in distributed parallel environments
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
This page was built for publication: Multiple search direction conjugate gradient method I: methods and their propositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4823351)
