On the public citation graph
Incremental Condition Estimation for Sparse Matrices
0 signed · 43 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.1002/nme.1620180804openalex-snapshot
Yale sparse matrix package I: The symmetric codes
inferredcites →https://doi.org/10.1007/bf01396012openalex-snapshot
Rank-one modification of the symmetric eigenproblem
inferredcites →https://doi.org/10.1007/bf01397471openalex-snapshot
Updating the singular value decomposition
inferredcites →https://doi.org/10.1007/bfb0092961openalex-snapshot
Generalizing the LINPACK condition estimator
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/0902031openalex-snapshot
Condition Number Estimation for Sparse Matrices
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/0907081openalex-snapshot
On General Row Merging Schemes for Sparse Givens Transformations
inferredcites →https://doi.org/10.1137/1015032openalex-snapshot
Some Modified Matrix Eigenvalue Problems
inferredcites →https://doi.org/10.1137/1029112openalex-snapshot
A Survey of Condition Number Estimation for Triangular Matrices
inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.7146/dpb.v9i123.6541openalex-snapshot
Direct Methods for Sparse Matrices
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)1097-0363(19971015)25:7<739::aid-fld581>3.0.co;2-yopenalex-snapshot
ILUS: An incomplete LU preconditioner in sparse skyline format
inferred← citeshttps://doi.org/10.1002/nla.2235openalex-snapshot
Spectral condition‐number estimation of large sparse matrices
inferred← citeshttps://doi.org/10.1006/jcph.2001.6795openalex-snapshot
The Construction of Projection Vectors for a Deflated ICCG Method Applied to Problems with Extreme Contrasts in the Coefficients
inferred← citeshttps://doi.org/10.1007/978-1-4612-2856-1_7openalex-snapshot
Solution of Sparse Weighted and Equality Constrained Least Squares Problems
inferred← citeshttps://doi.org/10.1007/bf02145580openalex-snapshot
Adaptive Lanczos methods for recursive condition estimation
inferred← citeshttps://doi.org/10.1007/s10915-013-9716-xopenalex-snapshot
Probabilistic Upper Bounds for the Matrix Two-Norm
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00385-8openalex-snapshot
A robust ILU with pivoting based on monitoring the growth of the inverse factors
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/s1570-8659(00)07002-2openalex-snapshot
Gaussian elimination for the solution of linear systems of equations
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1021946924741openalex-snapshot
Incremental Norm Estimation for Dense and Sparse Matrices
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1109/shpcc.1992.232669openalex-snapshot
Solving equality constrained least squares problems
inferred← citeshttps://doi.org/10.1137/050638369openalex-snapshot
On the Computation of Null Spaces of Sparse Rectangular Matrices
inferred← citeshttps://doi.org/10.1137/0613078openalex-snapshot
Rank Detection Methods for Sparse Matrices
inferred← citeshttps://doi.org/10.1137/0614056openalex-snapshot
Error Bounds for the Computation of Null Vectors with Applications to Markov Chains
inferred← citeshttps://doi.org/10.1137/070698725openalex-snapshot
Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/0729016openalex-snapshot
A Note on Deferred Correction for Equality Constrained Least Squares Problems
inferred← citeshttps://doi.org/10.1137/130922872openalex-snapshot
On Incremental Condition Estimators in the 2-Norm
inferred← citeshttps://doi.org/10.1137/s0895479891223781openalex-snapshot
On Rank-Revealing Factorisations
inferred← citeshttps://doi.org/10.1137/s0895479892236532openalex-snapshot
Analysis of a QR Algorithm for Computing Singular Values
inferred← citeshttps://doi.org/10.1137/s0895479893244353openalex-snapshot
Sparse Multifrontal Rank Revealing QR Factorization
inferred← citeshttps://doi.org/10.2172/10133022openalex-snapshot
Robust incremental condition estimation
inferred← citeshttps://doi.org/10.25365/thesis.16030openalex-snapshot
Analysis and evaluation of Binary Cascade Iterative Refinement and comparison to other iterative refinement algorithms for solving linear systems
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.