scientific article; zbMATH DE number 434530

MaRDI QIDQ3139310zbMATH OpenFDO

Authors Zhaojun Bai, Dan Hu, Lothar Reichel

Publication date 15 August 1995

zbMATH Keywords

Arnoldi processgeneralized minimal residual methodGMRES methodGram-Schmidt methoditerative methodsKrylov subspaceslarge sparse nonsymmetric systems of linear equationsparallel computationperformanceQR factorization

Mathematics Subject Classification ID

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

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

(17)

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

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)