On the public citation graph

Parallel QR decomposition of a rectangular matrix

https://doi.org/10.1007/bf01389871
0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01389639openalex-snapshot
An alternative givens ordering
inferredcites →https://doi.org/10.1109/proc.1966.5273openalex-snapshot
Very high-speed computing systems
inferredcites →https://doi.org/10.1137/1020096openalex-snapshot
A Survey of Parallel Algorithms in Numerical Linear Algebra
inferredcites →https://doi.org/10.1145/322047.322054openalex-snapshot
On Stable Parallel Linear System Solvers
inferredcites →https://doi.org/10.1145/322358.322366openalex-snapshot
Solving Linear Algebraic Equations on an MIMD Computer

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-51859-2_9openalex-snapshot
Complexity of the parallel Givens factorization on shared memory architectures
inferred← citeshttps://doi.org/10.1007/3-540-53065-7_94openalex-snapshot
Parallel givens factorization on a shared memory multiprocessor
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_53openalex-snapshot
Computing the complete orthogonal decomposition using a SIMD array processor
inferred← citeshttps://doi.org/10.1007/3-540-62598-4_129openalex-snapshot
On a feasible descent algorithm for solving min-max problems
inferred← citeshttps://doi.org/10.1007/3540761691_9openalex-snapshot
Parallel Algorithms for Computing Rank-Revealing QR Factorizations
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_162openalex-snapshot
Linear Least Squares and Orthogonal Factorization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3613-7_21openalex-snapshot
Numerical and Computational Strategies for Solving Seemingly Unrelated Regression Models
inferred← citeshttps://doi.org/10.1007/978-3-031-52186-7_15openalex-snapshot
Parallel Hybrid-Heterogeneous Single Value Decomposition Factorization
inferred← citeshttps://doi.org/10.1007/978-3-642-54420-0_64openalex-snapshot
Implementing a Systolic Algorithm for QR Factorization on Multicore Clusters with PaRSEC
inferred← citeshttps://doi.org/10.1007/978-3-642-76717-3_11openalex-snapshot
Scheduling Parallel Factorization Algorithms on a Shared Memory Computer
inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_7openalex-snapshot
Orthogonal Factorization and Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1007/pl00009283openalex-snapshot
Parallel Strategies for Computing the Orthogonal Factorizations Used in the Estimation of Econometric Models
inferred← citeshttps://doi.org/10.1007/s10543-008-0180-1openalex-snapshot
Blocked algorithms for the reduction to Hessenberg-triangular form revisited
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90063-xopenalex-snapshot
QR factorization of a dense matrix on a shared-memory multiprocessor
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90163-4openalex-snapshot
Parallel QR factorization by householder and modified Gram-Schmidt algorithms
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90102-dopenalex-snapshot
A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90030-oopenalex-snapshot
Parallel QR factorization using the torus-wrap mapping
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90072-wopenalex-snapshot
Least-squares multiple updating algorithms on a hypercube
inferred← citeshttps://doi.org/10.1016/j.parco.2005.11.001openalex-snapshot
Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM
inferred← citeshttps://doi.org/10.1016/j.parco.2013.01.003openalex-snapshot
Hierarchical QR factorization algorithms for multi-core clusters
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00132-1openalex-snapshot
Greedy Givens algorithms for computing the rank-k updating of the QR decomposition
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80144-9openalex-snapshot
Efficient logarithmic time parallel algorithms for the cholesky decomposition and gram-schmidt process
inferred← citeshttps://doi.org/10.1080/00207168708803597openalex-snapshot
Parallel solution of dense linear systems using diagonalization methods
inferred← citeshttps://doi.org/10.1080/00207168808803674openalex-snapshot
Systolic givens factorization of dense rectangular matrices
inferred← citeshttps://doi.org/10.1080/01495730008947350openalex-snapshot
PARALLEL GIVENS SEQUENCES FOR SOLVING THE GENERAL LINEAR MODEL ON A EREW PRAM∗
inferred← citeshttps://doi.org/10.1080/10637199508915487openalex-snapshot
NEW PARALLEL STRATEGIES FOR BLOCK UPDATING THE QR DECOMPOSITION∗
inferred← citeshttps://doi.org/10.1080/13658816.2011.563744openalex-snapshot
A parallel computing approach to fast geostatistical areal interpolation
inferred← citeshttps://doi.org/10.1109/icpp.1996.537375openalex-snapshot
A three-parameter fast Givens QR algorithm for superscalar processors
inferred← citeshttps://doi.org/10.1109/ipdps.2012.62openalex-snapshot
Hierarchical QR Factorization Algorithms for Multi-core Cluster Systems
inferred← citeshttps://doi.org/10.1109/ipdps.2017.46openalex-snapshot
Bidiagonalization and R-Bidiagonalization: Parallel Tiled Algorithms, Critical Paths and Distributed-Memory Implementation
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00020openalex-snapshot
Communication-Avoiding Cholesky-QR2 for Rectangular Matrices
inferred← citeshttps://doi.org/10.1109/jiot.2018.2849375openalex-snapshot
A Reversed Visible Light Multitarget Localization System via Sparse Matrix Reconstruction
inferred← citeshttps://doi.org/10.1109/mec.2013.6885312openalex-snapshot
An implementation of the QR iterations for finding eigenvalues of matrices with CUDA on GPU
inferred← citeshttps://doi.org/10.1109/tencon.1993.320220openalex-snapshot
Improving the performance of optimum parallel algorithms on SIMD array processors: programming techniques and methods
inferred← citeshttps://doi.org/10.1109/tii.2022.3210038openalex-snapshot
Design and Analysis of Two Nonlinear ZNN Models for Matrix LR and QR Factorization With Application to 3-D Moving Target Location
inferred← citeshttps://doi.org/10.1109/wacv.2018.00143openalex-snapshot
QRkit: Sparse, Composable QR Decompositions for Efficient and Stable Solutions to Problems in Computer Vision
inferred← citeshttps://doi.org/10.1137/080731992openalex-snapshot
Communication-optimal Parallel and Sequential QR and LU Factorizations
inferred← citeshttps://doi.org/10.1137/0910067openalex-snapshot
Distributed Orthogonal Factorization: Givens and Householder Algorithms
inferred← citeshttps://doi.org/10.1137/0911057openalex-snapshot
QR Factorization of a Dense Matrix on a Hypercube Multiprocessor
inferred← citeshttps://doi.org/10.1137/1032002openalex-snapshot
Parallel Algorithms for Dense Linear Algebra Computations
inferred← citeshttps://doi.org/10.1137/s0895479896308585openalex-snapshot
Parallel Strategies for Rank- k Updating of the QR Decomposition
inferred← citeshttps://doi.org/10.1145/174652.174660openalex-snapshot
Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM
inferred← citeshttps://doi.org/10.1145/2063384.2063393openalex-snapshot
Tiled QR factorization algorithms
inferred← citeshttps://doi.org/10.1145/2686892openalex-snapshot
Algorithm-Based Fault Tolerance for Dense Matrix Factorizations, Multiple Failures and Accuracy
inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0110578openalex-snapshot
Parallel QR Factorization using Givens Rotations in MPI-CUDA for Multi-GPU
inferred← citeshttps://doi.org/10.32657/10220/48559openalex-snapshot
Advanced visible light-based indoor positioning techniques : development and analysis
inferred← citeshttps://doi.org/10.3390/math11102308openalex-snapshot
Bounded Adaptive Function Activated Recurrent Neural Network for Solving the Dynamic QR Factorization
inferred← citeshttps://doi.org/10.48550/arxiv.0806.2159openalex-snapshot
Communication-optimal parallel and sequential QR and LU factorizations: theory and practice
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4475openalex-snapshot
Tiled QR factorization algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1303.3182openalex-snapshot
Tiled Algorithms for Matrix Computations on Multicore Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1611.06892openalex-snapshot
Bidiagonalization with Parallel Tiled Algorithms
inferred← citeshttps://doi.org/10.70675/3f0c5b2cz09e4z450fzb2d7z6fe013164207openalex-snapshot
Memory-aware algorithms : from multicores to large scale platforms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.