Stability analysis and improvement of the block Gram-Schmidt algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Stability analysis and improvement of the block Gram-Schmidt algorithm

Abstract

The advent of supercomputers with hierarchical memory systems has imposed the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in depth study. In this paper, the numerical stability of Block Gram Schmidt orthogonalization is studied and a variant is proposed which has numerical properties similar to the classical Modified-Gram-Schmidt while retaining most of the performance advantages of the block formulation.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1162.pdf (966.83 Ko) Télécharger le fichier

Dates and versions

inria-00075396 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075396 , version 1

Cite

William Jalby, Bernard Philippe. Stability analysis and improvement of the block Gram-Schmidt algorithm. [Research Report] RR-1162, INRIA. 1990. ⟨inria-00075396⟩
163 View
10465 Download

Share

Gmail Facebook Twitter LinkedIn More