Randomized block Gram-Schmidt process for solution of linear systems and eigenvalue problems

by   Oleg Balabanov, et al.

We propose a block version of the randomized Gram-Schmidt process for computing a QR factorization of a matrix. Our algorithm inherits the major properties of its single-vector analogue from [Balabanov and Grigori, 2020] such as higher efficiency than the classical Gram-Schmidt algorithm and stability of the modified Gram-Schmidt algorithm, which can be refined even further by using multi-precision arithmetic. As in [Balabanov and Grigori, 2020], our algorithm has an advantage of performing standard high-dimensional operations, that define the overall computational cost, with a unit roundoff independent of the dominant dimension of the matrix. This unique feature makes the methodology especially useful for large-scale problems computed on low-precision arithmetic architectures. Block algorithms are advantageous in terms of performance as they are mainly based on cache-friendly matrix-wise operations, and can reduce communication cost in high-performance computing. The block Gram-Schmidt orthogonalization is the key element in the block Arnoldi procedure for the construction of Krylov basis, which in its turn is used in GMRES and Rayleigh-Ritz methods for the solution of linear systems and clustered eigenvalue problems. In this article, we develop randomized versions of these methods, based on the proposed randomized Gram-Schmidt algorithm, and validate them on nontrivial numerical examples.



There are no comments yet.


page 1

page 2

page 3

page 4


Randomized Gram-Schmidt process with application to GMRES

A randomized Gram-Schmidt algorithm is developed for orthonormalization ...

An overview of block Gram-Schmidt methods and their stability properties

Block Gram-Schmidt algorithms comprise essential kernels in many scienti...

Pseudoinverse-free randomized extended block Kaczmarz for solving least squares

Randomized iterative algorithms have recently been proposed to solve lar...

Semi-Automatic Task Graph Construction for ℋ-Matrix Arithmetic

A new method to construct task graphs for -matrix arithmetic is introduc...

Performance of Refined Isogeometric Analysis in Solving Quadratic Eigenvalue Problems

Certain applications that analyze damping effects require the solution o...

Randomized Riemannian Preconditioning for Quadratically Constrained Problems

Optimization problem with quadratic equality constraints are prevalent i...

N-gram Statistical Stemmer for Bangla Corpus

Stemming is a process that can be utilized to trim inflected words to st...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.