On the public citation graph
Perturbation bounds for theLDL H andLU decompositions
0 signed · 29 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/bf01931293openalex-snapshot
Perturbation bounds for the Cholesky andQR factorizations
inferredcites →https://doi.org/10.1007/bf01932136openalex-snapshot
Perturbation bounds on the polar decomposition
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-0-8176-4968-5_12openalex-snapshot
Papers on Matrix Decompositions
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/bf01994852openalex-snapshot
Componentwise perturbation bounds for some matrix decompositions
inferred← citeshttps://doi.org/10.1007/bf02510255openalex-snapshot
On the sensitivity of the LU factorization
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/s10543-012-0398-9openalex-snapshot
Numerical stability of orthogonalization methods with a non-standard inner product
inferred← citeshttps://doi.org/10.1007/s11075-023-01646-2openalex-snapshot
The forward rounding error analysis of the partial pivoting quaternion LU decomposition
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.1016/0024-3795(92)90423-8openalex-snapshot
Rounding-error and perturbation bounds for the Cholesky and LDLT factorizations
inferred← citeshttps://doi.org/10.1016/j.cam.2012.01.003openalex-snapshot
Stability of block LU factorization for block tridiagonal block H -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.tcs.2017.03.034openalex-snapshot
Mixed and componentwise condition numbers for matrix decompositions
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00273-6openalex-snapshot
Exponential splittings of products of matrices and accurately computing singular values of long products
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/0308108031000069155openalex-snapshot
Perturbations of Triangular Matrix Factorizations
inferred← citeshttps://doi.org/10.1090/psapm/048/1314843openalex-snapshot
A survey of componentwise perturbation theory in numerical linear algebra
inferred← citeshttps://doi.org/10.1137/040612142openalex-snapshot
Perturbation Theory for Factorizations of LU Type through Series Expansions
inferred← citeshttps://doi.org/10.1137/0614078openalex-snapshot
On the Perturbation of LU, Cholesky, and QR Factorizations
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.1137/130943613openalex-snapshot
Relative Perturbation Theory for Diagonally Dominant Matrices
inferred← citeshttps://doi.org/10.1137/s0895479895292503openalex-snapshot
An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
inferred← citeshttps://doi.org/10.11650/twjm/1500405447openalex-snapshot
PERTURBATION ANALYSIS FOR THE MATRIX EQUATIONS X ± A∗X−1A = I
inferred← citeshttps://doi.org/10.4208/jcm.1004-m0009openalex-snapshot
On Smooth LU Decompositions with Applications to Solutions of Nonlinear Eigenvalue Problems
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.