# Conjugate Gradient and Lanczos Methods for Sparse Matrices on Distributed Memory Multiprocessors

@article{Basermann1997ConjugateGA, title={Conjugate Gradient and Lanczos Methods for Sparse Matrices on Distributed Memory Multiprocessors}, author={Achim Basermann}, journal={J. Parallel Distributed Comput.}, year={1997}, volume={45}, pages={46-52} }

Conjugate gradient methods for solving sparse systems of linear equations and Lanczos algorithms for sparse symmetric eigenvalue problems play an important role in numerical methods for solving discretized partial differential equations. When these iterative solvers are parallelized on a multiprocessor system with distributed memory, the data distribution and the communication scheme?depending on the data structures used for the sparse coefficient matrices?are crucial for efficient execution…

## 8 Citations

### Parallel scheduling of the PCG method for banded matrices rising from FDM/FEM

- Computer ScienceJ. Parallel Distributed Comput.
- 2003

### Parallelization Model for Successive Approximations to the Rayleigh-Ritz Linear Variational Problem

- MathematicsIEEE Trans. Parallel Distributed Syst.
- 1998

It is shown in this paper that these two strategies may be applied independently of one another, and the advantages of applying both parallelization levels simultaneously to the problem are discussed.

### Nesting OpenMP and MPI in the Conjugate Gradient Method for Band Systems

- Computer SciencePVM/MPI
- 2004

An analysis of the data dependencies in the Conjugate Gradient iterative method for the solution of narrow band systems is performed in order to develop and implement a mixed OpenMP-MPI code which…

### A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges

- Computer ScienceInt. J. Comput. Math.
- 2009

An algorithm capable of working in parallel for solving variable statistics with large and sparse linear equations under given right hand side ranges can be adapted for the system under domain decompositions structure leading to a better efficiency experimentally.

### Multiple search direction conjugate gradient method II: theory and numerical experiments

- Computer ScienceInt. J. Comput. Math.
- 2004

Numerical experiments on two distributed parallel computers show the efficiency of the MSD-CG method and show that it compares favorably with some domain decomposition methods.

### Multiple search direction conjugate gradient method I: methods and their propositions

- Computer ScienceInt. J. Comput. Math.
- 2004

The GIPF-CG method, an approximate version of the MSD- CG method, only requires communication between neighboring subdomains and eliminate global inner product entirely, which is well suited for massively parallel computation.

### Reducing Dimensionality Using NMF Based Cholesky Decomposition

- Computer ScienceRACS
- 2017

The increased dimensionality arising due to non-orthogonally from NMF is resolved using Cholesky decomposition (cd-NMF), which proves that the proposed technique fits well with larger instances in finding the documents as per the query.

## References

SHOWING 1-10 OF 11 REFERENCES

### Vectorization and parallelization of the conjugate gradient algorithm on hypercube-connected vector processors

- Computer ScienceMicroprocessing and Microprogramming
- 1990

### A class of Lanczos-like algorithms implemented on parallel computers

- Computer ScienceParallel Comput.
- 1991

### A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices

- Computer ScienceParallel Comput.
- 1992

### Lanczos algorithms for large symmetric eigenvalue computations

- Computer Science, Mathematics
- 1985

This chapter discusses Lanczos Procedures with no Reorthogonalization for Real Symmetric Problems, and an Identification Test, 'Good' versus' spurious' Eigenvalues.

### Numerical Modelling of Field Scale Transport in Heterogeneous Variably Saturated Porous Media

- Geology
- 1993

### Numerical modeling of eld scale transport in heterogeneous variably saturated porous media

- Numerical modeling of eld scale transport in heterogeneous variably saturated porous media
- 1993

### Numerical modeling of field scale transport in heterogeneous variably saturated porous media

- Numerical modeling of field scale transport in heterogeneous variably saturated porous media
- 1993

### Lanczos Algorithms for Large Symmetric Eigen- value Computations, Volume I: Theory. Birkh auser

- Boston Basel Stuttgart,
- 1985

### Numeri- cal modeling of eld scale transport in heterogeneous variably saturated porous media

- Internal Report No
- 1993