Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors
The paper presents algorithms for iteratively solving sparse systems of linear equations arising by the discretization of differential equations and corresponding eigenproblems on parallel systems with distributed memory. The conjugate gradient and Lanczos methods have been parallelized. The approaches of flexible data distribution, overlapping the communication and computation are applied. The algorithms developed have been tested successfully for large finite element matrices on the Paragon XP/S 10 system.
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- scientific article; zbMATH DE number 125197 (Why is no real title available?)
- Investigation of parallel computation in 3D magnetic field analysis on distributed memory type of multiprocessors containing 296 PUs
- Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
- Multiple search direction conjugate gradient method II: theory and numerical experiments
- Multiple search direction conjugate gradient method I: methods and their propositions
- scientific article; zbMATH DE number 833704 (Why is no real title available?)
- The RSCG algorithm on distributed memory architectures
- Solving systems of linear equations arising in the computation of logarithms in a finite prime field
- Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
This page was built for publication: Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373792)