On the public citation graph

An Interval Analysis Approach to Rank Determination in Linear Least Squares Problems

0 signed · 24 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.1007/bf01436075openalex-snapshot
Numerical methods for solving linear least squares problems
inferredcites →https://doi.org/10.1007/bf01436084openalex-snapshot
Linear least squares solutions by householder transformations
inferredcites →https://doi.org/10.1007/bf01932945openalex-snapshot
A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
inferredcites →https://doi.org/10.1007/bf01932992openalex-snapshot
On computing bounds for the least singular value of a triangular matrix
inferredcites →https://doi.org/10.1137/0702016openalex-snapshot
Calculating the Singular Values and Pseudo-Inverse of a Matrix
inferredcites →https://doi.org/10.1137/0702025openalex-snapshot
Interval Arithmetic in Matrix Computations, Part I
inferredcites →https://doi.org/10.1137/0704001openalex-snapshot
Interval Arithmetic in Matrix Computations, Part II
inferredcites →https://doi.org/10.1137/0716029openalex-snapshot
An Estimate for the Condition Number of a Matrix
inferredcites →https://doi.org/10.2307/2286501openalex-snapshot
Solving Least Squares Problems.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-85096-7_12openalex-snapshot
Applications
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90115-1openalex-snapshot
Rank and null space calculations using matrix decomposition without column interchanges
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90270-3openalex-snapshot
On the comparison of H-matrices with M-matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90103-0openalex-snapshot
Rank revealing QR factorizations
inferred← citeshttps://doi.org/10.1016/0024-3795(90)90241-4openalex-snapshot
On the error estimate for the projection of a point onto a linear manifold
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00152-popenalex-snapshot
Hybrid norms and bounds for overdetermined linear systems
inferred← citeshttps://doi.org/10.1016/j.amc.2017.05.077openalex-snapshot
Solving over-constrained systems of non-linear interval equations – And its robotic application
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.035openalex-snapshot
On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)60815-2openalex-snapshot
On the Identification and Structure of Uncertain Linear Systems
inferred← citeshttps://doi.org/10.1090/s0025-5718-1992-1106970-4openalex-snapshot
Rank-revealing 𝑄𝑅 factorizations and the singular value decomposition
inferred← citeshttps://doi.org/10.1109/asap.1992.218554openalex-snapshot
A systolic rank revealing QR algorithm
inferred← citeshttps://doi.org/10.1137/0913043openalex-snapshot
Some Applications of the Rank Revealing QR Factorization
inferred← citeshttps://doi.org/10.1137/1029112openalex-snapshot
A Survey of Condition Number Estimation for Triangular Matrices
inferred← citeshttps://doi.org/10.1364/josab.7.000003openalex-snapshot
Doppler-free saturation spectroscopy of lutetium isotopes through resonance-ionization mass spectrometry
inferred← citeshttps://doi.org/10.70675/cab0d2dbzd588z4eefzb8bez6341074cd80eopenalex-snapshot
Étalonnage des robots à câbles : identification et qualification
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.