An efficient implementation of the block Gram,Schmidt method

Yoichi Matsuo, Takashi Nodera

Research output: Contribution to journalArticle

Abstract

The block Gram,Schmidt method computes the qr factorisation rapidly, but this is dependent on block size m. We endeavor to determine the optimal m automatically during one execution. Our algorithm determines m through observing the relationship between computation time and complexity. Numerical experiments show that our proposed algorithms compute approximately twice as fast as the block Gram,Schmidt method for some block sizes, and is a viable option for computing the QR factorisation in a more stable and rapid manner.

Original languageEnglish
Pages (from-to)C476-C491
JournalANZIAM Journal
Volume54
Issue numberSUPPL
Publication statusPublished - 2012 Dec 1

Keywords

  • Block Gram,Schmidt algorithm
  • Optimal block size
  • Parallel computing

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Fingerprint Dive into the research topics of 'An efficient implementation of the block Gram,Schmidt method'. Together they form a unique fingerprint.

Cite this