ZIB

Hits per page

hits 1 - 2 | 2 hits

Sorting

Electronic Resource

Low-rank revealing QR factorizations (1994)

Chan, Tony F. ; Hansen, Per Christian

New York, NY [u.a.] : Wiley-Blackwell

Numerical Linear Algebra with Applications 1 (1994), S. 33-44

add to mindlist on the mindlist

Details

ISSN: 1070-5325

Keywords: Rank revealing QR factorization ; Column pivoting ; Numerical rank ; Subset selection ; Engineering ; Engineering General

Source: Wiley InterScience Backfile Collection 1832-2000

Topics: Mathematics

Notes: Rank revealing factorizations are used extensively in signal processing in connection with, for example, linear prediction and signal subspace algorithms. We present an algorithm for computing rank revealing QR factorizations of low-rank matrices. The algorithm produces tight upper and lower bounds for all the largest singular values, thus making it particularly useful for treating rank deficient problems by means of subset selection, truncated QR, etc. The algorithm is similar in spirit to an algorithm suggested earlier by Chan for matrices with a small nullity, and it can also be considered as an extension of ordinary column pivoting.

Additional Material: 1 Ill.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1002/nla.1680010105

Permalink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

Electronic Resource

Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems (1998)

Chan, Tony F. ; de Pillis, Lisette ; van der Vorst, Henk

Springer

Numerical algorithms 17 (1998), S. 51-66

add to mindlist on the mindlist

Details

ISSN: 1572-9265

Keywords: Lanczos algorithm ; quasi-minimal residual algorithm ; bi-conjugate gradients algorithm ; nonsymmetric linear systems ; Krylov subspace methods ; 65F10 ; 65N20

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the same tridiagonal matrix as the classical algorithm, using two matrix–vector products per iteration without accessing AT. We apply this algorithm to obtain a transpose-free version of the Quasi-minimal residual method of Freund and Nachtigal [15] (without look-ahead), which requires three matrix–vector products per iteration. We also present a related transpose-free version of the bi-conjugate gradients algorithm.