On the public citation graph

The economical storage of plane rotations

0 signed · 49 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.1093/imamat/12.3.329openalex-snapshot

Least Squares Computations by Givens Transformations Without Square Roots

inferredcites →https://doi.org/10.2307/2003558openalex-snapshot

The Algebraic Eigenvalue Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199707/08)4:4<305::aid-nla104>3.0.co;2-dopenalex-snapshot

Alternatives for parallel Krylov subspace basis computation

inferred← citeshttps://doi.org/10.1002/9780471722199.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1002/nla.1680020605openalex-snapshot

A saxpy formulation for plane rotations

inferred← citeshttps://doi.org/10.1007/978-0-8176-4968-5openalex-snapshot

G.W. Stewart

inferred← citeshttps://doi.org/10.1007/978-3-030-69674-0_6openalex-snapshot

Free Vibration of Multiple Degrees of Freedom System

inferred← citeshttps://doi.org/10.1007/978-3-319-05089-8_2openalex-snapshot

Linear Least Squares Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-21551-3_5openalex-snapshot

Numerical Linear Algebra

inferred← citeshttps://doi.org/10.1007/978-3-662-39812-8_2openalex-snapshot

Solution of Sparse Systems of Equations on Multiprocessor Architectures

inferred← citeshttps://doi.org/10.1007/bf01405565openalex-snapshot

The numerically stable reconstruction of Jacobi matrices from spectral data

inferred← citeshttps://doi.org/10.1007/bf01459074openalex-snapshot

Fast Givens rotations for orthogonal similarity transformations

inferred← citeshttps://doi.org/10.1007/bf02142742openalex-snapshot

An efficient Total Least Squares algorithm based on a rank-revealing two-sided orthogonal decomposition

inferred← citeshttps://doi.org/10.1007/bfb0085717openalex-snapshot

Solution of sparse systems of equations on multiprocessor architectures

inferred← citeshttps://doi.org/10.1016/0024-3795(80)90159-7openalex-snapshot

Solution of sparse linear least squares problems using 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/0045-7825(77)90036-6openalex-snapshot

Linear systems with a large number of sparse constraints with applications to incompressible materials

inferred← citeshttps://doi.org/10.1016/0377-0427(86)90169-xopenalex-snapshot

The QR algorithm for unitary Hessenberg matrices

inferred← citeshttps://doi.org/10.1016/0898-1221(82)90051-7openalex-snapshot

Comparison of two pivotal strategies in sparse plane rotations

inferred← citeshttps://doi.org/10.1016/b978-0-12-803804-8.00015-5openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00010-5openalex-snapshot

A projective simplex method for linear programming

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/s0898-1221(98)00024-8openalex-snapshot

A dual projective simplex method for linear programming

inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00323-5openalex-snapshot

A projective simplex algorithm using LU decomposition

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80203-8openalex-snapshot

Chapter 6 A survey of matrix computations

inferred← citeshttps://doi.org/10.1016/s1570-8659(05)80036-5openalex-snapshot

Least squares methods

inferred← citeshttps://doi.org/10.1017/cbo9780511812231openalex-snapshot

Numerical Methods of Statistics

inferred← citeshttps://doi.org/10.1017/cbo9780511977176.007openalex-snapshot

Regression Computations

inferred← citeshttps://doi.org/10.1109/arrays.1988.18051openalex-snapshot

A one dimensional systolic array for solving arbitrarily large least mean square problems

inferred← citeshttps://doi.org/10.1109/tac.1985.1103900openalex-snapshot

Numerical linear algebra aspects of control design computations

inferred← citeshttps://doi.org/10.1137/040610106openalex-snapshot

The Snap-Back Pivoting Method for Symmetric Banded Indefinite Matrices

inferred← citeshttps://doi.org/10.1137/0612041openalex-snapshot

Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation

inferred← citeshttps://doi.org/10.1137/0904016openalex-snapshot

The Singular Value Decomposition in Product Form

inferred← citeshttps://doi.org/10.1137/0904020openalex-snapshot

Systolic Networks for Orthogonal Decompositions

inferred← citeshttps://doi.org/10.1137/0905037openalex-snapshot

Numerical Methods for Large Sparse Linear Least Squares Problems

inferred← citeshttps://doi.org/10.1137/0907031openalex-snapshot

Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations

inferred← citeshttps://doi.org/10.1137/0909008openalex-snapshot

A Data Structure for Sparse $QR$ and $LU$ Factorizations

inferred← citeshttps://doi.org/10.1137/0911057openalex-snapshot

QR Factorization of a Dense Matrix on a Hypercube Multiprocessor

inferred← citeshttps://doi.org/10.1137/s1064827595280211openalex-snapshot

Using Level 3 BLAS in Rotation-Based Algorithms

inferred← citeshttps://doi.org/10.1142/9789814343305_0022openalex-snapshot

Parallel Algorithms and Architectures in Control Theory and Linear Systems

inferred← citeshttps://doi.org/10.1145/3544789openalex-snapshot

Robust level-3 BLAS Inverse Iteration from the Hessenberg Matrix

inferred← citeshttps://doi.org/10.1145/355841.355847openalex-snapshot

Basic Linear Algebra Subprograms for Fortran Usage

inferred← citeshttps://doi.org/10.1145/356012.356020openalex-snapshot

Remark on “Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage”

inferred← citeshttps://doi.org/10.1145/567806.567809openalex-snapshot

On computing givens rotations reliably and efficiently

inferred← citeshttps://doi.org/10.1190/1.1444543openalex-snapshot

2-D and 3-D interpretation of electrical tomography measurements; Part 1, The forward problem

inferred← citeshttps://doi.org/10.1190/1.1444544openalex-snapshot

2-D and 3-D interpretation of electrical tomography measurements; Part 2, The inverse problem

inferred← citeshttps://doi.org/10.21236/ada113070openalex-snapshot

Numerical Linear Algebra.

inferred← citeshttps://doi.org/10.21437/interspeech.2005-643openalex-snapshot

Modeling intra-speaker variability for speaker recognition

inferred← citeshttps://doi.org/10.4995/thesis/10251/59421openalex-snapshot

Development of a New 3D Reconstruction Algorithm for Computed Tomography (CT)

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.