A Block Orthogonalization Procedure with Constant Synchronization Requirements

DOI10.1137/S1064827500370883zbMath1018.65050WikidataQ59359428 ScholiaQ59359428MaRDI QIDQ4785908

Kesheng Wu, Andreas Stathopoulos

Publication date: 5 January 2003

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmstabilitysingular value decompositionnumerical experimentsparallel computationerror analysisGram-Schmidt orthogonalizationorthonormal basisHouseholder QR factorization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Orthogonalization in numerical linear algebra (65F25)

Related Items (25)

Mixed precision algorithms in numerical linear algebra ⋮ Randomized algorithms for distributed computation of principal component analysis and singular value decomposition ⋮ Basis selection in LOBPCG ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations ⋮ TTDFT: a GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations ⋮ Inversion of Eddy-Current Signals Using a Level-Set Method and Block Krylov Solvers ⋮ Householder Orthogonalization with a Nonstandard Inner Product ⋮ Reorthogonalized block classical Gram-Schmidt ⋮ Parallel solution of large-scale eigenvalue problem for master equation in protein folding dynamics ⋮ Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations ⋮ KSPHPDDM and PCHPDDM: extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners ⋮ Cholesky and Gram-Schmidt Orthogonalization for Tall-and-Skinny QR Factorizations on Graphics Processors ⋮ Extensions to the modified Gram–Schmidt strategy and its application in the steepest ascent method ⋮ Sensitivity Analysis for Maxwell Eigenvalue Problems in Industrial Applications ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ A Robust and Efficient Implementation of LOBPCG ⋮ Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices ⋮ Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations ⋮ A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices ⋮ Development of the block BiCGGR2 method for linear systems with multiple right-hand sides ⋮ Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects ⋮ Block Modified Gram--Schmidt Algorithms and Their Analysis ⋮ Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs ⋮ Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

Uses Software

• ATLAS
• BLAS

This page was built for publication: A Block Orthogonalization Procedure with Constant Synchronization Requirements