Atlas home || Conferences | Abstracts | about Atlas

International Conference on Mathematical Modeling and Scientific Computing
April 2-6, 2001
Middle East Technical University and Selcuk University
Ankara and Konya, Turkey

Organizers
F. Bornemann (Munich University of Tecnology, Germany), H. Bulgak (Selcuk University, Konya, Turkey), V. Ganzha (Munich University of Technology, Germany), B. Karasozen (METU, Ankara, Turkey), A. Sinan (Selcuk University, Konya, Turkey), C. Zenger (Munich University of Technology, Germany)

View Abstracts
Conference Homepage

An Algorithm for a Sliding Window ULV Decomposition
by
Hasan Erbay
Department of Computer Science, Penn State University

An Algorithm for a Sliding Window ULV Decomposition abstract = The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). The ULVD can be modified much faster than the SVD. When modifiying the ULVD, the accurate computation of the subspaces is required in certain time varying applications in signal processing. In this paper we present an updating algorithm which is suitable for large scaled matrices of low rank and as effective as alternatives.

Date received: January 22, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cagk-31.