Stability analysis and improvement of the block Gram-Schmidt algorithm:

Abstract: "The advent of supercomputers with hierarchical memory systems has necessitated 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 scal...

Full description

Saved in:
Bibliographic Details
Main Authors: Jalby, William (Author), Philippe, B. (Author)
Format: Book
Language:English
Published: Urbana, Ill. 1990
Series:Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 913
Subjects:
Summary:Abstract: "The advent of supercomputers with hierarchical memory systems has necessitated 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."
Physical Description:20 Bl. graph. Darst.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!