A parallel GMRES version for general sparse matrices
zbMATH Open0860.65021MaRDI QIDQ1920179FDOQ1920179
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
sparse matrixparallel computationQR factorizationNewton basisperformancesGMRES algorithmgeneralized minimal residual algorithm
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10)
Cited In (22)
- Title not available (Why is that?)
- Adaptive cross approximation for ill-posed problems
- On the Application of Optimal Control Techniques to the Shadowing Approach for Time Averaged Sensitivity Analysis of Chaotic Systems
- Adaptive cross approximation for Tikhonov regularization in general form
- Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
- On the generation of Krylov subspace bases
- A parallel implementation of the CMRH method for dense linear systems
- Scalability analysis of parallel GMRES implementations
- A streaming approach for sparse matrix products and its application in Galerkin multigrid methods
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- Analysis and parallel implementation of a forced \(N\)-body problem
- Hybrid grid-particle methods and penalization: a Sherman-Morrison-Woodbury approach to compute 3D viscous flows using FFT
- Title not available (Why is that?)
- On the cost of iterative computations
- Tridiagonal Toeplitz matrices: properties and novel applications
- s-Step Enlarged Krylov Subspace Conjugate Gradient Methods
- Varying the \(s\) in your \(s\)-step GMRES
- GMRES algorithms over 35 years
- Communication Avoiding ILU0 Preconditioner
- Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Parallel sparse matrix solution and performance 👍 👎
- Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices 👍 👎
- Large-Scale Scientific Computing 👍 👎
- A direct parallel sparse matrix solver 👍 👎
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)
