On the public citation graph

Some remarks on the perturbation of polar decompositions for rectangular matrices

0 signed · 21 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/1099-1506(200007/08)7:5<337::aid-nla200>3.0.co;2-4openalex-snapshot
On the condition numbers associated with the polar factorization of a matrix
inferredcites →https://doi.org/10.1007/bf01932136openalex-snapshot
Perturbation bounds on the polar decomposition
inferredcites →https://doi.org/10.1007/bf01989752openalex-snapshot
A perturbation bound for the generalized polar decomposition
inferredcites →https://doi.org/10.1017/cbo9780511810817openalex-snapshot
Matrix Analysis
inferredcites →https://doi.org/10.1023/b:bitn.0000039423.58964.e1openalex-snapshot
Some New Perturbation Bounds for the Generalized Polar Decomposition
inferredcites →https://doi.org/10.1137/0614041openalex-snapshot
Perturbation Bounds for the Polar Decomposition
inferredcites →https://doi.org/10.1137/s0895479801394623openalex-snapshot
Perturbation Bounds of Unitary and Subunitary Polar Factors
inferredcites →https://doi.org/10.1137/s0895479802413625openalex-snapshot
New Perturbation Bounds for Unitary Polar Factors
inferredcites →https://doi.org/10.1137/s0895479893256359openalex-snapshot
New Perturbation Bounds for the Unitary Polar Factor

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4976903openalex-extracted
Match Made with Matrix Completion: Efficient Offline and Online Learning in Matching Markets
inferred← citeshttps://doi.org/10.1002/nla.591openalex-snapshot
Perturbation bounds for weighted polar decomposition in the weighted unitarily invariant norm
inferred← citeshttps://doi.org/10.1007/s10092-008-0146-3openalex-snapshot
Variations for the Q- and H-factors in the polar decomposition
inferred← citeshttps://doi.org/10.1007/s11464-008-0033-xopenalex-snapshot
Perturbation analysis for best approximation and the polar factor by subunitary matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2014.02.013openalex-snapshot
Some new perturbation bounds of generalized polar decomposition
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124987openalex-snapshot
An optimal perturbation bound for the partial isometry associated to the generalized polar decomposition
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.10.009openalex-snapshot
Relative perturbation bounds for weighted polar decomposition
inferred← citeshttps://doi.org/10.1016/j.laa.2008.03.025openalex-snapshot
On the perturbation bound in unitarily invariant norms for subunitary polar factors
inferred← citeshttps://doi.org/10.1080/03081087.2012.693921openalex-snapshot
New perturbation bounds for the subunitary polar factors
inferred← citeshttps://doi.org/10.1155/2012/219025openalex-snapshot
Relative and Absolute Perturbation Bounds for Weighted Polar Decomposition
inferred← citeshttps://doi.org/10.7153/mia-13-37openalex-snapshot
Multiplicative perturbation bounds for weighted unitary polar factor
inferred← citeshttps://doi.org/10.7153/mia-16-26openalex-snapshot
New perturbation bounds for nonnegative and positive polar factors
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.