Pages that link to "Item:Q4595495"
From MaRDI portal
The following pages link to Parallel complexity of householder QR factorization (Q4595495):
Displaying 4 items.
- Parallel quadrant interlocking factorization on hypercube computers (Q919737) (← links)
- A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer (Q1184549) (← links)
- Hyperbolic Householder Algorithms for Factoring Structured Matrices (Q3350653) (← links)
- Fast Parallel Algorithms for QR and Triangular Factorization (Q3769848) (← links)