A parallel GMRES version for general sparse matrices
From MaRDI portal
Publication:1920179
zbMath0860.65021MaRDI QIDQ1920179
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
parallel computation; sparse matrix; QR factorization; GMRES algorithm; performances; Newton basis; generalized minimal residual algorithm
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
Related Items
Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, s-Step Enlarged Krylov Subspace Conjugate Gradient Methods, Communication Avoiding ILU0 Preconditioner, Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method, Tridiagonal Toeplitz matrices: properties and novel applications, Adaptive cross approximation for ill-posed problems, 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, 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., Varying the \(s\) in your \(s\)-step GMRES, A parallel implementation of the CMRH method for dense linear systems, Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
Uses Software
