Updating URV decompositions in parallel

DOI10.1016/0167-8191(94)90079-5zbMath0792.65015OpenAlexW1977700955MaRDI QIDQ1319521

G. W. Stewart

Publication date: 31 July 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: http://purl.umn.edu/1913

zbMATH Keywords

factorizationparallelization methodsURV decompositionMIMD algorithmparallel updating procedure

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

A block QR algorithm and the singular value decomposition ⋮ Perturbation theory for orthogonal projection methods with applications to least squares and total least squares ⋮ Functions of a matrix and Krylov matrices ⋮ An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition ⋮ On the \(QR\) algorithm and updating the \(SVD\) and the \(URV\) decomposition in parallel ⋮ Parallel codes for computing the numerical rank

This page was built for publication: Updating URV decompositions in parallel