On the public citation graph
Robust incremental condition estimation
0 signed · 35 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/bf01396012openalex-snapshot
Rank-one modification of the symmetric eigenproblem
inferredcites →https://doi.org/10.1007/bf01436075openalex-snapshot
Numerical methods for solving linear least squares problems
inferredcites →https://doi.org/10.1007/bf02145580openalex-snapshot
Adaptive Lanczos methods for recursive condition estimation
inferredcites →https://doi.org/10.1007/bfb0092961openalex-snapshot
Generalizing the LINPACK condition estimator
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0343558-6openalex-snapshot
Methods for Modifying Matrix Factorizations
inferredcites →https://doi.org/10.1137/0611047openalex-snapshot
Incremental Condition Estimation for Sparse Matrices
inferredcites →https://doi.org/10.1137/0613077openalex-snapshot
Adaptive Condition Estimation for Rank-One Updates of QR Factorizations
inferredcites →https://doi.org/10.1137/0716029openalex-snapshot
An Estimate for the Condition Number of a Matrix
inferredcites →https://doi.org/10.1137/0717034openalex-snapshot
The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
inferredcites →https://doi.org/10.1137/0907011openalex-snapshot
Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix
inferredcites →https://doi.org/10.1137/0911047openalex-snapshot
Experience with a Matrix Norm Estimator
inferredcites →https://doi.org/10.1137/0912002openalex-snapshot
A Parallel QR Factorization Algorithm with Controlled Local Pivoting
inferredcites →https://doi.org/10.1137/0912073openalex-snapshot
Structure-Preserving and Rank-Revealing QR-Factorizations
inferredcites →https://doi.org/10.1137/1.9781611971217openalex-snapshot
Solving Least Squares Problems
inferredcites →https://doi.org/10.1137/1029112openalex-snapshot
A Survey of Condition Number Estimation for Triangular Matrices
inferredcites →https://doi.org/10.1145/76263.76290openalex-snapshot
A block QR factorization algorithm using restricted pivoting
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(199807/08)5:4<275::aid-nla131>3.0.co;2-bopenalex-snapshot
A new adaptive GMRES algorithm for achieving high accuracy
inferred← citeshttps://doi.org/10.1006/jcph.2002.7102openalex-snapshot
On Backtracking Failure in Newton–GMRES Methods with a Demonstration for the Navier–Stokes Equations
inferred← citeshttps://doi.org/10.1007/bf02139475openalex-snapshot
A block algorithm for computing rank-revealing QR factorizations
inferred← citeshttps://doi.org/10.1017/s096249290000235xopenalex-snapshot
Parallel numerical linear algebra
inferred← citeshttps://doi.org/10.1080/01495730208941444openalex-snapshot
SCALABILITY ANALYSIS OF PARALLEL GMRES IMPLEMENTATIONS
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00096openalex-snapshot
Adaptive s-Step GMRES with Randomized and Truncated Low-Synchronization Orthogonalization
inferred← citeshttps://doi.org/10.1137/070698725openalex-snapshot
Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/s0895479894262339openalex-snapshot
GMRES On (Nearly) Singular Systems
inferred← citeshttps://doi.org/10.1137/s1052623497329671openalex-snapshot
Parallel Adaptive GMRES Implementations for Homotopy Methods
inferred← citeshttps://doi.org/10.1145/2450153.2450157openalex-snapshot
Efficient generalized Hessenberg form and applications
inferred← citeshttps://doi.org/10.1145/290200.287637openalex-snapshot
Computing rank-revealing QR factorizations of dense matrices
inferred← citeshttps://doi.org/10.1155/2015/246019openalex-snapshot
Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations
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.