On the public citation graph

On computing bounds for the least singular value of a triangular matrix

https://doi.org/10.1007/bf01932992
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.1007/978-3-642-05156-2openalex-snapshot
Matrix Iterative Analysis
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.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem

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-319-23413-7_116openalex-snapshot
The European Project nanoCOPS for Nanoelectronic Coupled Problems Solutions
inferred← citeshttps://doi.org/10.1007/s10092-003-0080-3openalex-snapshot
On updating the least singular value: a lower bound
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)90287-mopenalex-snapshot
On estimating the least singular value of a matrix
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80203-8openalex-snapshot
Chapter 6 A survey of matrix computations
inferred← citeshttps://doi.org/10.1016/s1570-8659(05)80036-5openalex-snapshot
Least squares methods
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/tac.1981.1102563openalex-snapshot
Properties of numerical algorithms related to computing controllability
inferred← citeshttps://doi.org/10.1134/s1995423912030056openalex-snapshot
On the construction of high order A(α)-stable hybrid linear multistep methods for stiff IVPs in ODEs
inferred← citeshttps://doi.org/10.1137/0611021openalex-snapshot
Incremental Condition Estimation
inferred← citeshttps://doi.org/10.1137/0902027openalex-snapshot
An Interval Analysis Approach to Rank Determination in Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/0903014openalex-snapshot
Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/1029112openalex-snapshot
A Survey of Condition Number Estimation for Triangular Matrices
inferred← citeshttps://doi.org/10.1145/305658.287651openalex-snapshot
A test package for Sturm-Liouville solvers
inferred← citeshttps://doi.org/10.1145/355759.355762openalex-snapshot
Blended Linear Multistep Methods
inferred← citeshttps://doi.org/10.1145/356502.356496openalex-snapshot
Software for roundoff analysis, II
inferred← citeshttps://doi.org/10.6028/nbs.sp.500-93openalex-snapshot
Software validation, verification, and testing technique and tool reference guide
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.