scientific article; zbMATH DE number 434530

MaRDI QIDQ3139310zbMATH OpenFDO

Authors Zhaojun Bai, Dan Hu, Lothar Reichel

Publication date 15 August 1995

zbMATH Keywords

performanceKrylov subspacesgeneralized minimal residual methoditerative methodsparallel computationGMRES methodArnoldi processQR factorizationGram-Schmidt methodlarge sparse nonsymmetric systems of linear equations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 592765
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• A fast implementation for GMRES method
• Implementations of the GMRES method
• A simpler GMRES

Cited in

(14)

• On the role of orthogonality in the GMRES method
• Alternatives for parallel Krylov subspace basis computation
• scientific article; zbMATH DE number 592765 (Why is no real title available?)
• On the similarities between the quasi-Newton inverse least squares method and GMRES
• A new implementation of GMRES using generalized Purcell method
• On the generation of Krylov subspace bases
• Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG
• Iterated Gauss-Seidel GMRES
• A fast implementation for GMRES method
• A parallel implementation of the CMRH method for dense linear systems
• Randomized Gram-Schmidt process with application to GMRES
• Algorithm 842
• Krylov-subspace methods for the Sylvester equation
• Communication lower bounds and optimal algorithms for numerical linear algebra

This page was built for publication:

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