Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
From MaRDI portal
Publication:4857574
DOI10.1137/S0895479893247679zbMATH Open0837.65029MaRDI QIDQ4857574FDOQ4857574
Authors: 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)
Recommendations
- Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks
- Retooling the method of block conjugate gradients
- Parallel variable-triangular iterative methods in Krylov subspaces
- A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer
- A block conjugate gradient method applied to linear systems with multiple right-hand sides
convergenceparallel computationorthogonal projectorblock iterationlarge sparse symmetric positive definite linear systemsvariable block conjugate gradient method
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)
Cited In (38)
- On the convergence of the Bl-LSQR algorithm for solving matrix equations
- A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
- A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
- A block preconditioner for the Gl-LSMR algorithm
- A new projected variant of the deflated block conjugate gradient method
- Efficient iterative algorithms for the stochastic finite element method with application to acoustic scattering
- A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
- Simultaneous FETI and block FETI: robust domain decomposition with multiple search directions
- 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 new family of global methods for 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
- A breakdown-free block conjugate gradient method
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Restarted block-GMRES with deflation of eigenvalues
- Generalized global conjugate gradient squared algorithm
- An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems
- PARALLEL VARIATIONAL ITERATIVE LINEAR SOLVERS
- Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- A block GMRES method augmented with eigenvectors
- BACKWARD PERTURBATION ANALYSIS AND RELATIVE ALGORITHMS FOR NONSYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES
- Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis
- A breakdown of the block CG method
- A novel class of block methods based on the block \(AA^T\)-Lanczos bi-orthogonalization process for matrix equations
- A deflated conjugate gradient method for multiple right hand sides and multiple shifts
- A block Krylov subspace implementation of the time-parallel Paraexp method and its extension for nonlinear partial differential equations
- Retooling the method of block conjugate gradients
- A Lanczos-type method for multiple starting vectors
- Convergence properties of block GMRES and matrix polynomials
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- Block conjugate gradient algorithms for least squares problems
- An automatic procedure for updating the block size in the block conjugate gradient method for solving linear systems
- The block Hessenberg process for matrix equations
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- Exact and inexact breakdowns in the block GMRES method
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857574)
