On the public citation graph

Computational aspects of deciding if all roots of a polynomial lie within the unit circle

https://doi.org/10.1007/bf02252078
0 signed · 25 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.1093/qmath/16.3.241openalex-snapshot
ON THE DISTRIBUTION OF THE ZEROS OF A POLYNOMIAL
inferredcites →https://doi.org/10.1109/jrproc.1962.288193openalex-snapshot
A Simplified Stability Criterion for Linear Discrete Systems
inferredcites →https://doi.org/10.1109/proc.1965.3612openalex-snapshot
A modified stability table for linear discrete systems
inferredcites →https://doi.org/10.1109/swat.1971.20openalex-snapshot
On decreasing the computing time for modular arithmetic
inferredcites →https://doi.org/10.1109/swat.1972.5openalex-snapshot
Fast modular transforms via division
inferredcites →https://doi.org/10.1145/321371.321381openalex-snapshot
Subresultants and Reduced Polynomial Remainder Sequences
inferredcites →https://doi.org/10.1145/321662.321664openalex-snapshot
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
inferredcites →https://doi.org/10.1145/321662.321665openalex-snapshot
On Euclid's Algorithm and the Theory of Subresultants
inferredcites →https://doi.org/10.1145/321662.321666openalex-snapshot
The Calculation of Multivariate Polynomial Resultants
inferredcites →https://doi.org/10.1145/321662.321667openalex-snapshot
Integer Arithmetic Algorithms for Polynomial Real Zero Determination
inferredcites →https://doi.org/10.1145/800204.806279openalex-snapshot
The SAC-1 system
inferredcites →https://doi.org/10.1145/800204.806287openalex-snapshot
Modular arithmetic and finite field theory
inferredcites →https://doi.org/10.2307/2004500openalex-snapshot
The Art of Computer Programming. Vol. II: Seminumerical Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01187696openalex-snapshot
Reflections on Schur-Cohn matrices and Jury-Marden tables and classification of related unit circle zero location criteria
inferred← citeshttps://doi.org/10.1007/s00034-014-9824-3openalex-snapshot
Fraction-Free Unit Circle Stability Tests
inferred← citeshttps://doi.org/10.1016/j.laa.2009.08.012openalex-snapshot
Bounds for resultants of univariate and bivariate polynomials
inferred← citeshttps://doi.org/10.1080/03081087.2018.1455802openalex-snapshot
A fraction-free unit-circle zero location test for a polynomial with any singularity profile
inferred← citeshttps://doi.org/10.1080/03081087.2019.1632253openalex-snapshot
Fraction-free computation of the unit-circle resultant with any singularity profile
inferred← citeshttps://doi.org/10.1109/31.1707openalex-snapshot
Modified stability table for 2-D digital filters
inferred← citeshttps://doi.org/10.1109/82.298377openalex-snapshot
On two-dimensional filter stability test
inferred← citeshttps://doi.org/10.1109/acc.2010.5531143openalex-snapshot
Integer Levinson algorithms for Toeplitz and certain Toeplitz-like matrices
inferred← citeshttps://doi.org/10.1109/icassp.2008.4518426openalex-snapshot
Levinson algorithm over integers for strongly regular Hermitian toeplitz matrices
inferred← citeshttps://doi.org/10.1109/iscas.2006.1693569openalex-snapshot
Testing a polynomial for zeros inside the unit-circle over the ring of Gaussian integers
inferred← citeshttps://doi.org/10.1109/iscas.2010.5537668openalex-snapshot
Fraction-free inversion of a Toeplitz matrix
inferred← citeshttps://doi.org/10.1109/tcsii.2005.856032openalex-snapshot
Critical stability constraints for discrete-time linear systems
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.