On the public citation graph

The Sequential Construction of Minimal Partial Realizations from Finite Input–Output Data

0 signed · 28 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.1016/0005-1098(72)90098-2openalex-snapshot
Partial realization of random systems
inferredcites →https://doi.org/10.1016/s0019-9958(71)90105-7openalex-snapshot
Canonical minimal realization of a matrix of impulse response sequences
inferredcites →https://doi.org/10.1109/tac.1970.1099514openalex-snapshot
Construction of minimal linear state-variable models from finite input-output data
inferredcites →https://doi.org/10.1109/tac.1972.1099980openalex-snapshot
On partial realization
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1137/0309031openalex-snapshot
Recursive Identification of Linear Systems

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-0348-7709-1_18openalex-snapshot
Partial Realization as an Interpolation Problem
inferred← citeshttps://doi.org/10.1007/978-3-0348-8970-4_15openalex-snapshot
The Berlekamp-Massey algorithm, error-correction, keystreams and modeling
inferred← citeshttps://doi.org/10.1007/bfb0007590openalex-snapshot
On Recursiveness and Related Topics in Linear Systems: A Summary
inferred← citeshttps://doi.org/10.1016/0005-1098(77)90025-5openalex-snapshot
A method of constructing minimal approximate realizations of linear input-output behavior
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90682-4openalex-snapshot
A canonical matrix continued fraction solution of the minimal (partial) realization problem
inferred← citeshttps://doi.org/10.1016/0377-0427(90)90413-topenalex-snapshot
Minimal vector Padé approximation
inferred← citeshttps://doi.org/10.1016/j.laa.2003.11.010openalex-snapshot
A least squares approach to reduce stable discrete linear systems preserving their stability
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90496-9openalex-snapshot
Minimal torsion spaces and the partial input/output problem
inferred← citeshttps://doi.org/10.1016/s0024-3795(16)30318-4openalex-snapshot
A Matrix Euclidean Algorithm for minimal partial realization
inferred← citeshttps://doi.org/10.1016/s0090-5267(06)80049-6openalex-snapshot
Recursive Techniques in State-Space and Matrix Fraction Realizations for Linear Systems
inferred← citeshttps://doi.org/10.1016/s0167-6911(97)00059-5openalex-snapshot
An algorithm for constructing a minimal partial realization in the multivariable case
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)65411-9openalex-snapshot
Multivariable System Identification - A Survey
inferred← citeshttps://doi.org/10.1109/9.119647openalex-snapshot
Recursive independent state-space and matrix fraction realizations
inferred← citeshttps://doi.org/10.1109/cdc.1975.270575openalex-snapshot
A computational procedure for obtaining a polynomial representation from state equations
inferred← citeshttps://doi.org/10.1109/cdc.1985.268701openalex-snapshot
On the structure of matrix formal power series, and the recursive realization problem
inferred← citeshttps://doi.org/10.1109/cdc.1997.649603openalex-snapshot
Computing minimal partial realizations via a Lanczos-type algorithm for multiple starting vectors
inferred← citeshttps://doi.org/10.1109/icsyse.1992.236933openalex-snapshot
An efficient algorithm for minimal partial realization of matrix sequences
inferred← citeshttps://doi.org/10.1109/proc.1976.10071openalex-snapshot
The growing algebraic presence in systems engineering: An introduction
inferred← citeshttps://doi.org/10.1109/tac.1975.1100918openalex-snapshot
Uniqueness of minimal partial realizations
inferred← citeshttps://doi.org/10.1109/tac.1977.1101405openalex-snapshot
Generalized dynamic covers for linear systems with applications to deterministic identification and realization problems
inferred← citeshttps://doi.org/10.1109/tac.1986.1104191openalex-snapshot
On recursiveness and related topics in linear systems
inferred← citeshttps://doi.org/10.1515/9783112318805-006openalex-snapshot
Some applications of the Euclidean algorithm
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.