Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction

Abstract

The Golub–Kahan–Lanczos (GKL) bidiagonal reduction generates, by recurrence, the matrix factorization of X ∈ Rm×n,m ≥ n, given by X = U BV T where U ∈ Rm×n is left orthogonal, V ∈ Rn×n is orthogonal, and B ∈ Rn×n is bidiagonal. When the GKL recurrence is implemented in finite precision arithmetic, the columns of U and V tend to lose orthogonality, making a… (More)
DOI: 10.1007/s00211-013-0518-8

1 Figure or Table

Topics

  • Presentations referencing similar topics