On the public citation graph

Componentwise perturbation analyses for the QR factorization

https://doi.org/10.1007/pl00005447
0 signed · 34 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/bf01931293openalex-snapshot
Perturbation bounds for the Cholesky andQR factorizations
inferredcites →https://doi.org/10.1007/bf01994852openalex-snapshot
Componentwise perturbation bounds for some matrix decompositions
inferredcites →https://doi.org/10.1007/bf02165096openalex-snapshot
Condition numbers and equilibration of matrices
inferredcites →https://doi.org/10.1016/0024-3795(93)00077-dopenalex-snapshot
On perturbation bounds for the QR factorization
inferredcites →https://doi.org/10.1016/s0024-3795(98)10100-3openalex-snapshot
Sensitivity analyses for factorizations of sparse or structured matrices
inferredcites →https://doi.org/10.1090/s0025-5718-1992-1106970-4openalex-snapshot
Rank-revealing 𝑄𝑅 factorizations and the singular value decomposition
inferredcites →https://doi.org/10.1137/0614078openalex-snapshot
On the Perturbation of LU, Cholesky, and QR Factorizations
inferredcites →https://doi.org/10.1137/0714030openalex-snapshot
Perturbation Bounds for the $QR$ Factorization of a Matrix
inferredcites →https://doi.org/10.1137/1.9780898718027openalex-snapshot
Accuracy and Stability of Numerical Algorithms
inferredcites →https://doi.org/10.1137/s0895479896297720openalex-snapshot
Perturbation Analyses for the QR Factorization
inferredcites →https://doi.org/10.4153/cmb-1966-083-2openalex-snapshot
Numerical Linear Algebra
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nla.1933openalex-snapshot
Imposing symmetry in augmented linear systems
inferred← citeshttps://doi.org/10.1002/nla.787openalex-snapshot
On the perturbation of the Q‐factor of the QR factorization
inferred← citeshttps://doi.org/10.1007/s10444-024-10198-5openalex-snapshot
A stochastic perturbation analysis of the QR decomposition and its applications
inferred← citeshttps://doi.org/10.1016/j.amc.2015.03.008openalex-snapshot
New rigorous perturbation bounds for the generalized Cholesky factorization
inferred← citeshttps://doi.org/10.1016/j.camwa.2012.03.036openalex-snapshot
Perturbation analysis for the hyperbolic QR factorization
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.034openalex-snapshot
Mixed and componentwise condition numbers for matrix decompositions
inferred← citeshttps://doi.org/10.1080/03081087.2013.845775openalex-snapshot
Perturbation analysis for the symplectic QR factorization
inferred← citeshttps://doi.org/10.1090/s0025-5718-2012-02545-2openalex-snapshot
Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction
inferred← citeshttps://doi.org/10.1109/med.2009.5164689openalex-snapshot
Avoiding fold bifurcations with the help of new proximity indices
inferred← citeshttps://doi.org/10.1137/06067818xopenalex-snapshot
On the Error in QR Integration
inferred← citeshttps://doi.org/10.1137/090761562openalex-snapshot
On the Error in the Product QR Decomposition
inferred← citeshttps://doi.org/10.1137/090778535openalex-snapshot
Rigorous Perturbation Bounds of Some Matrix Factorizations
inferred← citeshttps://doi.org/10.1137/140988541openalex-snapshot
Conditioning of Leverage Scores and Computation by QR Decomposition
inferred← citeshttps://doi.org/10.1145/1277548.1277597openalex-snapshot
Certification of the QR factor R and of lattice basis reducedness
inferred← citeshttps://doi.org/10.1145/2608628.2608645openalex-snapshot
LLL reducing with the most significant bits
inferred← citeshttps://doi.org/10.1145/2631948.2631955openalex-snapshot
Mixed and componentwise condition numbers for matrix decompositions
inferred← citeshttps://doi.org/10.1145/3721124openalex-snapshot
A Mixed Precision Jacobi SVD Algorithm
inferred← citeshttps://doi.org/10.3182/20140824-6-za-1003.00883openalex-snapshot
Multi-Order Covariance Computation for Estimates in Stochastic Subspace Identification Using QR Decompositions
inferred← citeshttps://doi.org/10.3390/math10244687openalex-snapshot
Componentwise Perturbation Analysis of the QR Decomposition of a Matrix
inferred← citeshttps://doi.org/10.3934/naco.2011.1.301openalex-snapshot
Multiplicative perturbation analysis for QR factorizations
inferred← citeshttps://doi.org/10.48550/arxiv.1405.0179openalex-snapshot
New rigorous perturbation bounds for the LU and QR factorizations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0701183openalex-snapshot
Certification of the QR factor R, and of lattice basis reducedness
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.