On the public citation graph
Optimal Block Diagonal $l_2 $-Scaling of Matrices
0 signed · 27 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/978-3-642-46092-0openalex-snapshot
The Theory of Max-Min and its Application to Weapons Allocation Problems
inferredcites →https://doi.org/10.1007/bf01408697openalex-snapshot
Optimally scaled matrices, necessary and sufficient conditions
inferredcites →https://doi.org/10.1007/bf02162515openalex-snapshot
Matrices which can be optimally scaled
inferredcites →https://doi.org/10.1007/bf02165096openalex-snapshot
Condition numbers and equilibration of matrices
inferredcites →https://doi.org/10.1007/bf02294158openalex-snapshot
Weighted Minimum Trace Factor Analysis
inferredcites →https://doi.org/10.1007/bf02296274openalex-snapshot
Rank-Reducibility of a Symmetric Matrix and Sampling Theory of Minimum Trace Factor Analysis
inferredcites →https://doi.org/10.1016/0024-3795(82)90014-3openalex-snapshot
Optimal block diagonal scaling of block 2-cyclic matrices
inferredcites →https://doi.org/10.1016/s0168-2024(09)x7002-5openalex-snapshot
Theory of Extremal Problems
inferredcites →https://doi.org/10.1088/0031-9112/11/7/011openalex-snapshot
Introduction to Matrix Analysis
inferredcites →https://doi.org/10.1090/s0002-9939-1955-0069585-4openalex-snapshot
On Best Conditioned Matrices
inferredcites →https://doi.org/10.1137/0711039openalex-snapshot
On a Characterization of the Best $l_2 $-Scaling of a matrix
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10958-005-0488-1openalex-snapshot
Solution of the Problem of Optimal Diagonal Scaling for Quasireal Hermitian Positive-Definite 3×3 Matrices
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.1080/03081089108818065openalex-snapshot
Upper bounds for nearly optimal diagonal scaling of matrices
inferred← citeshttps://doi.org/10.1109/icassp.2011.5947324openalex-snapshot
Bound-ratio minimization of filter bank frames by periodic precoding
inferred← citeshttps://doi.org/10.1109/tsp.2011.2165710openalex-snapshot
Optimal Two-Sided Diagonal Scaling for Filter Bank Frames
inferred← citeshttps://doi.org/10.1137/040612142openalex-snapshot
Perturbation Theory for Factorizations of LU Type through Series Expansions
inferred← citeshttps://doi.org/10.1137/0802007openalex-snapshot
Large-Scale Optimization of Eigenvalues
inferred← citeshttps://doi.org/10.1137/22m1504901openalex-snapshot
Nearly Optimal Block-Jacobi Preconditioning
inferred← citeshttps://doi.org/10.1137/s0363012992238680openalex-snapshot
Minimizing the Euclidean Condition Number
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.