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 computationsparse matrixQR factorizationGMRES algorithmperformancesNewton basisgeneralized minimal residual algorithm
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Related Items
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, Adaptive cross approximation for Tikhonov regularization in general form, On the Application of Optimal Control Techniques to the Shadowing Approach for Time Averaged Sensitivity Analysis of Chaotic Systems, Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors, On the generation of Krylov subspace bases, GMRES algorithms over 35 years, A parallel implementation of the CMRH method for dense linear systems, 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, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, Varying the \(s\) in your \(s\)-step GMRES, s-Step Enlarged Krylov Subspace Conjugate Gradient Methods, Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication, On the cost of iterative computations, An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating., Communication Avoiding ILU0 Preconditioner
Uses Software
