Square-root free orthogonalization algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

This paper is concerned with the derivation and analysis of higher order algorithms of polynomial type for computing an orthonormal basis of a subspace. These algorithms are derived from unconstrained optimization of certain cost functions. The proposed methods are efficient and do not require square root computation. Based on these, algorithms for orthonormalization with respect to a positive definite matrix and principal and minor subspace methods are developed. Numerical experiments illustrate the theoretical results.

Original languageEnglish (US)
Title of host publication2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009
Pages3173-3176
Number of pages4
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009 - Taipei, Taiwan, Province of China
Duration: Apr 19 2009Apr 24 2009

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009
CountryTaiwan, Province of China
CityTaipei
Period4/19/094/24/09

Keywords

  • Global stability
  • Gram-Schmidt process
  • Higher order fixed point polynomials
  • Orthonormalization

Fingerprint Dive into the research topics of 'Square-root free orthogonalization algorithms'. Together they form a unique fingerprint.

Cite this