QR factorizations using a restricted set of rotations

zbMATH Open1121.65317MaRDI QIDQ871148FDOQ871148

Dianne P. O'Leary, Stephen S. Bullock

Publication date: 16 March 2007

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/128023

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

QR decompositionGivens rotationsquditsquantum circuit designparallel QR decompositionplane rotations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Quantum computation (81P68) Orthogonalization in numerical linear algebra (65F25)

Cited In (1)

• Ordering Givens Rotations for Sparse $QR$ Factorization

   Recommendations

• Ordering Givens Rotations for Sparse $QR$ Factorization 👍 👎
• Structure-Preserving and Rank-Revealing QR-Factorizations 👍 👎
• A Rotation Method for Computing the QR-Decomposition 👍 👎
• Parallel QR decomposition of a rectangular matrix 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: QR factorizations using a restricted set of rotations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871148)