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
JournalANZIAM Journal
Volume54
Issue numberSUPPL
Publication statusPublished - 2012

Fingerprint

QR Factorization
Efficient Implementation
Numerical Experiment
Dependent
Computing
Relationships

Keywords

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

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Cite this

An efficient implementation of the block Gram,Schmidt method. / Matsuo, Yoichi; Nodera, Takashi.

In: ANZIAM Journal, Vol. 54, No. SUPPL, 2012.

Research output: Contribution to journalArticle

Matsuo, Y & Nodera, T 2012, 'An efficient implementation of the block Gram,Schmidt method', ANZIAM Journal, vol. 54, no. SUPPL.
Matsuo, Yoichi ; Nodera, Takashi. / An efficient implementation of the block Gram,Schmidt method. In: ANZIAM Journal. 2012 ; Vol. 54, No. SUPPL.
@article{63e7ce8fadbc41bbb2074c340bf2f792,
title = "An efficient implementation of the block Gram,Schmidt method",
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.",
keywords = "Block Gram,Schmidt algorithm, Optimal block size, Parallel computing",
author = "Yoichi Matsuo and Takashi Nodera",
year = "2012",
language = "English",
volume = "54",
journal = "ANZIAM Journal",
issn = "1446-1811",
publisher = "Cambridge University Press",
number = "SUPPL",

}

TY - JOUR

T1 - An efficient implementation of the block Gram,Schmidt method

AU - Matsuo, Yoichi

AU - Nodera, Takashi

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Block Gram,Schmidt algorithm

KW - Optimal block size

KW - Parallel computing

UR - http://www.scopus.com/inward/record.url?scp=84897847233&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897847233&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84897847233

VL - 54

JO - ANZIAM Journal

JF - ANZIAM Journal

SN - 1446-1811

IS - SUPPL

ER -