On the public citation graph

Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays

https://doi.org/10.1137/0908062
0 signed · 45 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/bf01436084openalex-snapshot
Linear least squares solutions by householder transformations
inferredcites →https://doi.org/10.1016/0024-3795(75)90068-3openalex-snapshot
Error analysis of QR decompositions by Givens transformations
inferredcites →https://doi.org/10.1016/0041-5553(66)90153-4openalex-snapshot
The algebraic eigenvalue problem
inferredcites →https://doi.org/10.1093/imamat/12.3.329openalex-snapshot
Least Squares Computations by Givens Transformations Without Square Roots
inferredcites →https://doi.org/10.1093/imamat/13.2.215openalex-snapshot
A Note on Modifications to the Givens Plane Rotation
inferredcites →https://doi.org/10.1109/mc.1982.1653828openalex-snapshot
Highly concurrent computing structures for matrix arithmetic and signal processing
inferredcites →https://doi.org/10.1137/0904020openalex-snapshot
Systolic Networks for Orthogonal Decompositions
inferredcites →https://doi.org/10.1137/0905007openalex-snapshot
Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors
inferredcites →https://doi.org/10.1145/322047.322054openalex-snapshot
On Stable Parallel Linear System Solvers
inferredcites →https://doi.org/10.2307/2005340openalex-snapshot
Solving Least Squares Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-0-387-09734-3_10openalex-snapshot
On Pipelined Implementations of QRD-RLS Adaptive Filters
inferred← citeshttps://doi.org/10.1007/978-0-387-09734-3_3openalex-snapshot
Conventional and Inverse QRD-RLS Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-46900-8_1openalex-snapshot
Parallel Linear Algebra in Statistical Computations
inferred← citeshttps://doi.org/10.1007/s00211-015-0779-5openalex-snapshot
Structured eigenvalue condition numbers for parameterized quasiseparable matrices
inferred← citeshttps://doi.org/10.1007/s11767-997-0011-6openalex-snapshot
Finite wordlength analyzing for RLS systolic algorithm based on the square-root-free scaled givens rotations
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00092-1openalex-snapshot
Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
inferred← citeshttps://doi.org/10.1016/0167-739x(89)90001-0openalex-snapshot
Algorithms for solving numerical linear algebra problems on supercomputers
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(93)90030-oopenalex-snapshot
Parallel QR factorization using the torus-wrap mapping
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90034-7openalex-snapshot
VLSI-suited orthogonal solution of systems of linear equations
inferred← citeshttps://doi.org/10.1016/s0169-7161(05)80133-6openalex-snapshot
9 Numerical aspects of solving linear least squares problems
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72638-0openalex-snapshot
The Impact of Parallel Architectures on The Solution of Eigenvalue Problems
inferred← citeshttps://doi.org/10.1023/a:1018970413988openalex-snapshot
A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition
inferred← citeshttps://doi.org/10.1080/00207169808804676openalex-snapshot
Systolic computation of QZ matrix decomposition
inferred← citeshttps://doi.org/10.1109/78.134478openalex-snapshot
Rotation-based RLS algorithms: unified derivations, numerical properties, and parallel implementations
inferred← citeshttps://doi.org/10.1109/78.205742openalex-snapshot
A unified square-root-free approach for QRD-based recursive-least-squares estimation
inferred← citeshttps://doi.org/10.1109/78.317867openalex-snapshot
A class of square root and division free algorithms and architectures for QRD-based adaptive signal processing
inferred← citeshttps://doi.org/10.1109/78.539042openalex-snapshot
Pipelined RLS adaptive filtering using scaled tangent rotations (STAR)
inferred← citeshttps://doi.org/10.1109/78.852021openalex-snapshot
Annihilation-reordering look-ahead pipelined CORDIC-based RLS adaptive filters and their application to adaptive beamforming
inferred← citeshttps://doi.org/10.1109/asap.1997.606823openalex-snapshot
Efficient implementation of rotation operations for high performance QRD-RLS filtering
inferred← citeshttps://doi.org/10.1109/icassp.1989.266674openalex-snapshot
An orthogonal method for solving systems of linear equations without square roots and with few divisions
inferred← citeshttps://doi.org/10.1109/icassp.1989.266952openalex-snapshot
Arithmetic implementation of the Givens QR triarray
inferred← citeshttps://doi.org/10.1109/icassp.1991.150515openalex-snapshot
A unified SQRT-free rank-1 up/down-dating approach for recursive least-squares problems
inferred← citeshttps://doi.org/10.1109/icit48603.2022.10002836openalex-snapshot
A Square-Root Free Implementation of the Square-Root V-BLAST Algorithm by a Wide-sense Complex Givens Rotation
inferred← citeshttps://doi.org/10.1109/iscas.1989.100323openalex-snapshot
VLSI-suited solution of linear systems
inferred← citeshttps://doi.org/10.1109/iscas.1990.112443openalex-snapshot
Hyperbolic rotation of subspaces and VLSI algorithms for signal processing and numerical linear algebra
inferred← citeshttps://doi.org/10.1109/iscas.1991.176316openalex-snapshot
Parallel methods for iterative matrix decompositions
inferred← citeshttps://doi.org/10.1109/iscas.1993.394080openalex-snapshot
A high throughput systolic design for QR algorithm
inferred← citeshttps://doi.org/10.1109/iscas.1993.693005openalex-snapshot
A high throughput systolic design for QR algorithm
inferred← citeshttps://doi.org/10.1137/0614025openalex-snapshot
A Systolic Array for SVD Updating
inferred← citeshttps://doi.org/10.1137/0725076openalex-snapshot
Error Analysis and Implementation Aspects of Deferred Correction for Equality Constrained Least Squares Problems
inferred← citeshttps://doi.org/10.1137/0912042openalex-snapshot
A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays
inferred← citeshttps://doi.org/10.1137/0915081openalex-snapshot
On the Parallel Implementation of Jacobi and Kogbetliantz Algorithms
inferred← citeshttps://doi.org/10.1137/s0895479890193017openalex-snapshot
Fast Plane Rotations with Dynamic Scaling
inferred← citeshttps://doi.org/10.21236/ada452710openalex-snapshot
A Class of Square Root and Division Free Algorithms and Architectures for QRD-Based Adaptive Signal Processing
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.