A Rotation Method for Computing the QR-Decomposition

From MaRDI portal

Publication:4725618

Jump to:navigation, search

DOI10.1137/0907030zbMath0616.65045OpenAlexW2089863429MaRDI QIDQ4725618

Franklin T. Luk

Publication date: 1986

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0907030

zbMATH Keywords

systolic arrays VLSI real-time computation QR factorization Jacobi algorithm plane rotations

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (4)

NEW PARALLEL STRATEGIES FOR BLOCK UPDATING THE QR DECOMPOSITION∗ ⋮ Some complexity results in parallel matrix-based signal processing ⋮ A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil ⋮ A triangular processor array for computing singular values

This page was built for publication: A Rotation Method for Computing the QR-Decomposition

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4725618&oldid=18971990"

Pages with script errors