On the public citation graph
On the sensitivity of the LU factorization
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.
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/bf01931295openalex-snapshot
Perturbation bounds for theLDL H andLU decompositions
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/s0024-3795(98)10100-3openalex-snapshot
Sensitivity analyses for factorizations of sparse or structured matrices
inferredcites →https://doi.org/10.1093/imanum/16.4.457openalex-snapshot
New perturbation analyses for the Cholesky factorization
inferredcites →https://doi.org/10.1093/imanum/17.1.1openalex-snapshot
On the perturbation of LU and Cholesky factors
inferredcites →https://doi.org/10.1137/0614078openalex-snapshot
On the Perturbation of LU, Cholesky, and QR Factorizations
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.5860/choice.34-0981openalex-snapshot
Accuracy and stability of numerical algorithms
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.1998openalex-snapshot
Improved rigorous perturbation bounds for the LU and QR factorizations
inferred← citeshttps://doi.org/10.1007/978-3-642-03737-5_3openalex-snapshot
Problems and Results in Matrix Perturbation Theory
inferred← citeshttps://doi.org/10.1007/s10543-004-6025-7openalex-snapshot
Stability and Sensitivity of Tridiagonal LU Factorization without Pivoting
inferred← citeshttps://doi.org/10.1007/s11253-017-1340-8openalex-snapshot
Perturbation and Error Analyses of the Partitioned LU Factorization for Block Tridiagonal Linear Systems
inferred← citeshttps://doi.org/10.1007/s11766-020-3659-4openalex-snapshot
Structured condition numbers and statistical condition estimation for the LDU factorization
inferred← citeshttps://doi.org/10.1016/j.cam.2017.12.010openalex-snapshot
Structured condition numbers for some matrix factorizations of structured matrices
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.08.008openalex-snapshot
Perturbation bounds for triangular and full rank factorizations
inferred← citeshttps://doi.org/10.1016/j.jvcir.2010.09.006openalex-snapshot
Stabilization and optimization of PLUS factorization and its application in image coding
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.1016/s0024-3795(98)10100-3openalex-snapshot
Sensitivity analyses for factorizations of sparse or structured matrices
inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00279-6openalex-snapshot
LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)00154-8openalex-snapshot
An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method
inferred← citeshttps://doi.org/10.1017/s1446181108000138openalex-snapshot
PERTURBATION THEORY FOR THE LU AND QR FACTORIZATIONS
inferred← citeshttps://doi.org/10.1023/a:1021970102451openalex-snapshot
Some Features of Gaussian Elimination with Rook Pivoting
inferred← citeshttps://doi.org/10.1080/00207160210940openalex-snapshot
Efficient Solution of a Sparse Non-symmetric System of Linear Equations
inferred← citeshttps://doi.org/10.1080/0308108031000069155openalex-snapshot
Perturbations of Triangular Matrix Factorizations
inferred← citeshttps://doi.org/10.1109/drpt.2011.5993990openalex-snapshot
A comparison of power flow by different ordering schemes
inferred← citeshttps://doi.org/10.1137/040612142openalex-snapshot
Perturbation Theory for Factorizations of LU Type through Series Expansions
inferred← citeshttps://doi.org/10.1137/090778535openalex-snapshot
Rigorous Perturbation Bounds of Some Matrix Factorizations
inferred← citeshttps://doi.org/10.1137/13093858xopenalex-snapshot
A New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices
inferred← citeshttps://doi.org/10.18514/mmn.2000.24openalex-snapshot
Componentwise perturbation bounds for the $LU$, $LDU$ and $LDT^T$ decompositions
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.2107.02579openalex-snapshot
Numerical Matrix Decomposition
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.