A parallel GMRES version for general sparse matrices

zbMATH Open0860.65021MaRDI QIDQ1920179FDOQ1920179

Authors J. Erhel

Publication date 14 April 1997

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119070

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

sparse matrixparallel computationQR factorizationNewton basisperformancesGMRES algorithmgeneralized minimal residual algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 953022
• scientific article; zbMATH DE number 592765
• Large-Scale Scientific Computing
• A direct parallel sparse matrix solver
• scientific article; zbMATH DE number 663839
• Parallel sparse matrix solution and performance
• Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
• Publication:4860193
• Publication:4860186

Cited in

(23)

• scientific article; zbMATH DE number 1305038 (Why is no real title available?)
• On the Application of Optimal Control Techniques to the Shadowing Approach for Time Averaged Sensitivity Analysis of Chaotic Systems
• Adaptive cross approximation for ill-posed problems
• Adaptive cross approximation for Tikhonov regularization in general form
• A streaming approach for sparse matrix products and its application in Galerkin multigrid methods
• Communication Avoiding ILU0 Preconditioner
• Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
• On the generation of Krylov subspace bases
• An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
• Scalability analysis of parallel GMRES implementations
• Enlarged Krylov subspace conjugate gradient methods for reducing communication
• Varying the \(s\) in your \(s\)-step GMRES
• Analysis and parallel implementation of a forced \(N\)-body problem
• Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined conjugate gradient method
• Hybrid grid-particle methods and penalization: a Sherman-Morrison-Woodbury approach to compute 3D viscous flows using FFT
• s-step enlarged Krylov subspace conjugate gradient methods
• scientific article; zbMATH DE number 592765 (Why is no real title available?)
• GMRES algorithms over 35 years
• Tridiagonal Toeplitz matrices: properties and novel applications
• A parallel implementation of the CMRH method for dense linear systems
• On the cost of iterative computations
• Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
• A parallel algorithm for incremental orthogonalization based on the compact WY representation

Describes a project that uses

Uses Software

• P-SPARSLIB

This page was built for publication: A parallel GMRES version for general sparse matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920179)