Low synchronization Gram–Schmidt and generalized minimal residual algorithms

DOI10.1002/nla.2343zbMath1474.65103OpenAlexW3094536092MaRDI QIDQ5858527

No author found.

Publication date: 13 April 2021

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2343

zbMATH Keywords

Krylov subspace methodsgraphics processing unitmassively parallel computersGram-Schmidt orthogonalization processscalable GMRES algorithmWY compact representation

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Orthogonalization in numerical linear algebra (65F25)

Related Items (5)

Adaptively restarted block Krylov subspace methods with low-synchronization skeletons ⋮ GMRES algorithms over 35 years ⋮ A Hamiltonian decomposition for fast interior-point solvers in model predictive control ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Randomized Gram--Schmidt Process with Application to GMRES

Uses Software

• BoomerAMG
• hypre
• Matlab
• CUDA
• SparseMatrix
• CUBLAS
• CUSPARSE

This page was built for publication: Low synchronization Gram–Schmidt and generalized minimal residual algorithms