Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme

DOI10.1137/S0895479893247679zbMath0837.65029MaRDI QIDQ4857574

A. A. Nikishin, A. Yu. Yeremin

Publication date: 21 May 1996

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

convergenceparallel computationorthogonal projectorblock iterationlarge sparse symmetric positive definite linear systemsvariable block conjugate gradient method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (34)

A breakdown-free block conjugate gradient method ⋮ A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides ⋮ Exact and inexact breakdowns in the block GMRES method ⋮ BACKWARD PERTURBATION ANALYSIS AND RELATIVE ALGORITHMS FOR NONSYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES ⋮ A block Krylov subspace implementation of the time-parallel Paraexp method and its extension for nonlinear partial differential equations ⋮ Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis ⋮ Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD ⋮ Simultaneous FETI and block FETI: Robust domain decomposition with multiple search directions ⋮ A block preconditioner for the Gl-LSMR algorithm ⋮ A new family of global methods for linear systems with multiple right-hand sides ⋮ A breakdown of the block CG method ⋮ On the convergence of the Bl-LSQR algorithm for solving matrix equations ⋮ A deflated conjugate gradient method for multiple right hand sides and multiple shifts ⋮ The block Hessenberg process for matrix equations ⋮ A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides ⋮ Block conjugate gradient algorithms for least squares problems ⋮ The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ On moment methods in Krylov subspaces ⋮ A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides ⋮ An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems ⋮ An Adaptive MultiPreconditioned Conjugate Gradient Algorithm ⋮ Block minimum perturbation algorithm based on block Arnoldi process for nonsymmetric linear systems with multiple right-hand sides ⋮ A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides ⋮ Restarted block-GMRES with deflation of eigenvalues ⋮ Efficient iterative algorithms for the stochastic finite element method with application to acoustic scattering ⋮ Generalized global conjugate gradient squared algorithm ⋮ A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides ⋮ A new projected variant of the deflated block conjugate gradient method ⋮ Convergence properties of block GMRES and matrix polynomials ⋮ A block GMRES method augmented with eigenvectors ⋮ A Lanczos-type method for multiple starting vectors ⋮ Matrix Krylov subspace methods for linear systems with multiple right-hand sides ⋮ A novel class of block methods based on the blockAA^T-Lanczos bi-orthogonalization process for matrix equations ⋮ Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides

This page was built for publication: Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme