On the public citation graph
Fast Givens rotations for orthogonal similarity transformations
0 signed · 28 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01462266openalex-snapshot
The economical storage of plane rotations
inferredcites →https://doi.org/10.1093/comjnl/4.3.265openalex-snapshot
The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
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.1137/0710024openalex-snapshot
An Algorithm for Generalized Matrix Eigenvalue 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/bf01388689openalex-snapshot
A Jacobi eigenreduction algorithm for definite matrix pairs
inferred← citeshttps://doi.org/10.1007/bf01396349openalex-snapshot
A note on a one-sided Jacobi algorithm
inferred← citeshttps://doi.org/10.1007/bf01990351openalex-snapshot
A real algorithm for the Hermitian eigenvalue decomposition
inferred← citeshttps://doi.org/10.1007/bf02240099openalex-snapshot
On a modification of the QZ algorithm with fast givens rotations
inferred← citeshttps://doi.org/10.1007/s002110050275openalex-snapshot
The ${\cal {D Q R}}$ algorithm, basic theory, convergence, and conditional stability
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-9260(95)00016-xopenalex-snapshot
An algorithm and architecture based on orthonormal μ-rotations for computing the symmetric EVD
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50007-7openalex-snapshot
Adaptive Approximate Rotations for Computing the Symmetric EVD
inferred← citeshttps://doi.org/10.1016/j.laa.2004.01.017openalex-snapshot
Quadratic convergence estimate of scaled iterates by J-symmetric Jacobi method
inferred← citeshttps://doi.org/10.1016/j.sigpro.2021.108451openalex-snapshot
Fast approximation of orthogonal matrices and application to PCA
inferred← citeshttps://doi.org/10.1109/78.863093openalex-snapshot
Efficient implementations of pipelined CORDIC based IIR digital filters using fast orthonormal μ-rotations
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/dmcc.1990.555398openalex-snapshot
Reducing Inner Product Computation in the Parallel One-Sided Jacobi Algorithm
inferred← citeshttps://doi.org/10.1109/icassp.1994.389995openalex-snapshot
Monitoring the stage of diagonalization in Jacobi-type methods
inferred← citeshttps://doi.org/10.1109/iscas.1991.176316openalex-snapshot
Parallel methods for iterative matrix decompositions
inferred← citeshttps://doi.org/10.1109/izsbc.2000.829236openalex-snapshot
Complex CORDIC-like algorithms for linearly constrained MVDR beamforming
inferred← citeshttps://doi.org/10.1109/pacrim.1993.407345openalex-snapshot
Efficient implementation of SVD-updating algorithms for subspace tracking
inferred← citeshttps://doi.org/10.1109/sspd51364.2021.9541430openalex-snapshot
Fast Givens Rotation Approach to Second Order Sequential Best Rotation Algorithms
inferred← citeshttps://doi.org/10.1111/j.1467-9892.1984.tb00387.xopenalex-snapshot
A NOTE ON THE COMPUTATION OF THE BAYESIAN DECOMPOSITION OF A TIME SERIES
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
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.